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
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
IEEE Transactions on Parallel and Distributed Systems
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Location updates for efficient routing in ad hoc networks
Handbook of wireless networks and mobile computing
Power-Aware Localized Routing in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Depth First Search and Location Based Localized Routing and QoS Routing in Wireless Networks
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
New Metrics for Dominating Set Based Energy Efficient Activity Scheduling in Ad Hoc Networks
LCN '03 Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks
IEEE Transactions on Parallel and Distributed Systems
Wireless Communications & Mobile Computing
Depth First Search-based and power-aware geo-routing in ad hoc and sensor wireless networks
International Journal of Autonomous and Adaptive Communications Systems
Position-based routing in ad hoc networks
IEEE Communications Magazine
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
Depth First Search-based and power-aware geo-routing in ad hoc and sensor wireless networks
International Journal of Autonomous and Adaptive Communications Systems
Hi-index | 0.00 |
Depth First Search (DFS) and position-based routing algorithms were proposed in literature. These are localised algorithms that guarantee the delivery for connected ad hoc and sensor wireless networks modelled by arbitrary graphs, including inaccurate location information for a destination node. This article first optimises an existing DFS-based routing scheme by eliminating from the candidate list neighbours whose messages to other nodes were overheard. We then introduce a new set of localised routing algorithms. The new DFS routing protocol is integrated with power metrics minimise total power for routing of a message. These DFS Power Progress-based algorithms are combinations of known greedy power and DFS routing algorithms. All algorithms are further enhanced by applying the concept of connected dominating sets, which greatly reduced the search path without impacting significantly the length of effectively constructed path for real traffic. Experiments confirm the efficiency of the new enhanced DFS, power-aware and connected dominating set-based routing algorithms and ability to guarantee the delivery in arbitrary model due to the DFS routing framework.