Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
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
A Scalable Logical Coordinates Framework for Routing in Wireless Sensor Networks
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
SGF: A state-free gradient-based forwarding protocol for wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Centroid virtual coordinates - A novel near-shortest path routing paradigm
Computer Networks: The International Journal of Computer and Telecommunications Networking
Quality-Driven Volcanic Earthquake Detection Using Wireless Sensor Networks
RTSS '10 Proceedings of the 2010 31st IEEE Real-Time Systems Symposium
| Hi-index | 0.00 |
New Wireless Sensor Networks (WSNs) applications are emerging with new requirements such as reliability and respect of time constraints. The underlying mechanisms such as MAC and routing must handle such requirements. To meet timing constraint, it is necessary to bound the hop-count between a node and the sink and the time it takes to do a hop. Thus, the end-to-end delay can be bounded and the communications are real-time. Due to the efficiency and scalability of greedy routing in WSNs and the financial cost of GPS chips, Virtual Coordinate Systems (VCSs) for WSNs have been proposed. A category of VCSs is based on the hop-count from the sink, this scheme leads to many nodes having the same coordinate. The main advantage of this system is that the hops number of a packet from a source to the sink is known. Nevertheless, it does not allow to differentiate the nodes with the same hop-count. For reliability purpose we propose to select forwarder nodes depending on how they are connected in the direction of the sink. In order to be able to do so we need a metric that gives information on hop-count, that allows to strongly differentiate nodes and gives information on the connectivity of each node. As this metric is linked to physical organization of the network it can be viewed as a virtual coordinate. In this paper we propose a novel hop-count-based VCS which aims at classifying the nodes having the same hop-count depending on their connectivity and at differentiating nodes in a 2-hop neighborhood. Those properties make the coordinates, which also can be viewed as a local identifier, a very powerful metric which can be used in WSNs mechanisms. We evaluate the performances of our solution theoretically and by simulation.