Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Tree-Based Data Broadcast in IEEE 802.15.4 and ZigBee Networks
IEEE Transactions on Mobile Computing
Relay Node Placement in Wireless Sensor Networks
IEEE Transactions on Computers
Censor networks: a critique of "sensor networks" from a systems perspective
ACM SIGCOMM Computer Communication Review
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
A survey on wireless mesh networks
IEEE Communications Magazine
Commercial Applications of Wireless Sensor Networks Using ZigBee
IEEE Communications Magazine
| Hi-index | 0.00 |
Most wireless sensor network deployments are 2- tiered where sensors form the leaves of the network and do not participate in the routing. A plot of the best path from each of the leaves to the sink reveals the network topology to be hierarchical in nature. The AODV routing algorithm was designed for a mesh network with highly mobile nodes and is not directly suitable for a hierarchical sensor network where the sensors and relays are predominantly static. The hierarchical routing as implemented by ZigBee's Cskip does not support fault tolerance and has a restriction on the network depth. In this paper, we develop a node addressing methodology that merges the structure of a hierarchical tree with the flexibility of AODV. We show its completeness and develop three algorithms - deterministic, probabilistic and heuristic, based on our methodology. The performance of the algorithms against AODV is compared. Our simulation is made for two probability distributions of network formation - uniform and geometric.