Dominating-set-based routing in ad hoc wireless networks
Handbook of wireless networks and mobile computing
Asymptotically optimal geometric mobile ad-hoc routing
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Self Organized Terminode Routing
Cluster Computing
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Electric-field-based routing: a reliable framework for routing in MANETs
ACM SIGMOBILE Mobile Computing and Communications Review
Wireless mesh networks: a survey
Computer Networks and ISDN Systems
Geographical Cluster-Based Routing in Sensing-Covered Networks
IEEE Transactions on Parallel and Distributed Systems
No-beacon GEDIR: location-based ad-hoc routing with less communication overhead
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
Boundary Mapping and Boundary-State Routing (BSR) in Ad Hoc Networks
IEEE Transactions on Mobile Computing
Planar graph routing on geographical clusters
Ad Hoc Networks
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Message-by-message route modification in wireless multihop transmission for shorter delay
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Secure and efficient data transmission in RFID sensor networks
International Journal of Security and Networks
Locally Optimal Source Routing for energy-efficient geographic routing
Wireless Networks
Minimizing recovery overhead in geographic ad hoc routing
Computer Communications
Greedy face routing with face identification support in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Half-space proximal: a new local test for extracting a bounded dilation spanner of a unit disk graph
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Up-Down Links Dualpath Greedy Routing Protocol for Wireless Sensor Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
Abstract: Several distributed routing algorithms for wireless networks were described recently, based on location information of nodes available via Global Positioning System (GPS). In greedy routing algorithm sender or node S currently holding the message m forwards m to one of its neighbors that is the closest to destination. The algorithm fails if S does not have any neighbor that is closer to destination than S. FACE algorithm guarantees the delivery of m if the network, modeled by unit graph, is connected. GFG algorithm combines greedy and FACE algorithms. Greedy algorithm is applied as long as possible, until delivery or a failure. In case of failure, the algorithm switches to FACE algorithm until a node closer to destination than last failure node is found, at which point greedy algorithm is applied again. In this paper we further improve the performance of GFG algorithm, by reducing its average hop count. First we improve the FACE algorithm by adding a sooner-back procedure for earlier escape from FACE mode. Then we perform a shortcut procedure at each forwarding node S. Node S uses the local information available to calculate as many hops as possible and forwards the packet to the last known hop directly instead of forwarding it to the next hop. The second improvement is based on the concept of dominating sets. The network of internal nodes defines a connected dominating set, and each node must be either internal or directly connected to an internal node. We apply several existing definitions of internal nodes, namely the concepts of intermediate, inter-gateway and gateway nodes. We propose to run GFG routing, enhanced by shortcut procedure, on the dominating set, except possibly the first and last hops. We obtained localized routing algorithm that guarantees delivery and has very low excess in terms of hop count compared to the shortest path algorithm. The experimental data show that the length of additional path (in excess of shortest path length) can be reduced to about half of that of existing GFG algorithm.