On Approximate Computer System Models
Journal of the ACM (JACM)
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Measurement and performance of a cognitive packet network
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on networking middleware: selected papers from the TERENA networking conference 2001
Design and performance of cognitive packet networks
Performance Evaluation
ESRT: event-to-sink reliable transport in wireless sensor networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
RAP: A Real-Time Communication Architecture for Large-Scale Wireless Sensor Networks
RTAS '02 Proceedings of the Eighth IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'02)
Cognitive Packet Networks: QoS and Performance
MASCOTS '02 Proceedings of the 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
CODA: congestion detection and avoidance in sensor networks
Proceedings of the 1st 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
IEEE Transactions on Mobile Computing
A diffusion model for packet travel time in a random multihop medium
ACM Transactions on Sensor Networks (TOSN)
Users and services in intelligent networks
AINTEC'05 Proceedings of the First Asian Internet Engineering conference on Technologies for Advanced Heterogeneous Networks
Adaptive packet prioritisation for wireless sensor networks
NGI'09 Proceedings of the 5th Euro-NGI conference on Next Generation Internet networks
Hi-index | 0.00 |
Much of the traffic carried by Sensor Networks will originate from routine measurements or observations by sensors which monitor a particular situation, such as the temperature and humidity in a room or the infrared observation of the perimeter of a house, so that the volume of routine traffic resulting from such observations may be quite high. When important and unusual events occur, such as a sudden fire breaking out or the arrival of an intruder, it will be necessary to convey this new information very urgently through the network to a designated set of sink nodes where this information can be processed and dealt with. This paper addresses the important challenge of avoiding that the volume of routine background traffic creates delays or bottlenecks that impede the rapid delivery of high priority traffic resulting from the unusual events. Specifically we propose a novel technique, the "Randomized Re-Routing Algorithm (RRR)", which detects the presence of novel events in a distributed manner, and dynamically disperses the background traffic towards secondary paths in the network, while creating a "fast track path" which provides better delay and better QoS for the high priority traffic which is carrying the new information. When the surge of new information has subsided, this is again detected by the nodes and they can progressively revert to best QoS or shortest path routing for all the ongoing traffic. The proposed technique is evaluated using a mathematical model as well as simulations.