The Cricket location-support system
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Infrastructure tradeoffs for sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
ESRT: event-to-sink reliable transport in wireless sensor networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
SPEED: A Stateless Protocol for Real-Time Communication in Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
TOSSIM: accurate and scalable simulation of entire TinyOS applications
Proceedings of the 1st international conference on Embedded networked sensor systems
CODA: congestion detection and avoidance in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Versatile low power media access for wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Mitigating congestion in wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Congestion control and fairness for many-to-one routing in sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
A congestion control technique for the near-sink nodes in wireless sensor networks
UIC'06 Proceedings of the Third international conference on Ubiquitous Intelligence and Computing
| Hi-index | 0.00 |
This paper presents a framework for a congestion reduction mechanism in multiple objects tracking applications. The multiple objects tracking application has a real-time characteristic, through which all packets should be delivered in as timely fashion as possible. The proposed framework consists of sink nodes, backbone nodes, mobile nodes and agent nodes. The location information of the mobile node is delivered to the sink node using both localization and routing techniques, which consider the network congestion. The proposed congestion reduction technique avoids network congestion by decreasing the number of transmitting packets based on the idea that network congestion occurs when the total data in transit is greater than the total channel capacity. The decrement is achieved by both merging and attachment operations, which consolidate several small packets into one large packet in intermediate backbone nodes. The mechanism also considers a time-constrained delivery to assure the user’s service request. The simulation is conducted using a TOSSIM simulator, and the result shows that the proposed mechanism improves performance in terms of the successful delivery ratio and the delay time.