Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
An efficient routing protocol for wireless networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
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
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
An energy consumption model for performance analysis of routing protocols for mobile ad hoc networks
Mobile Networks and Applications
Associativity-Based Routing for Ad Hoc Mobile Networks
Wireless Personal Communications: An International Journal
Power-Aware Localized Routing in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A Multi-Channel MAC Protocol with Power Control for Multi-Hop Mobile Ad Hoc Networks
ICDCSW '01 Proceedings of the 21st International Conference on Distributed Computing Systems
Performance of Route Caching Strategies in Dynamic Source Routing
ICDCSW '01 Proceedings of the 21st International Conference on Distributed Computing Systems
Conserving Transmission Power in Wireless Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Routing Mechanisms for Mobile Ad Hoc Networks Based on the Energy Drain Rate
IEEE Transactions on Mobile Computing
Power-Aware On-Demand Routing Protocol for MANET
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Adaptive Energy Conservation Model using Dynamic Caching for Wireless Devices
ANSS '04 Proceedings of the 37th annual symposium on Simulation
Agent-Based, Energy Efficient Routing in Sensor Networks
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
Reliable Energy Aware Routing In Wireless Sensor Networks
DSSNS '06 Proceedings of the Second IEEE Workshop on Dependability and Security in Sensor Networks and Systems
Power-Aware Routing Algorithm Based on Mobile Agents (PARAMA) in Mobile Ad Hoc Networks
ICESSSYMPOSIA '08 Proceedings of the 2008 International Conference on Embedded Software and Systems Symposia
Maximum battery life routing to support ubiquitous mobile computing in wireless ad hoc networks
IEEE Communications Magazine
Intelligent medium access for mobile ad hoc networks with busy tones and power control
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
In this paper, we propose a high performance routing protocol and a long lifetime routing protocol by considering the fact that the bandwidth between two mobile nodes should be different when distances are different. In the high performance routing protocol, to reduce the number of rerouting times, we take the bandwidth issue into account to choose the path with the capability to transmit the maximum amount of data with the help of the GPS. With exchanging the moving vectors and the coordinates of two adjacent mobile nodes, the possible link lifetime of two adjacent mobile nodes can be predicted. Subsequently, a path with the maximal amount of data transmission can be found. With regard to our proposed long lifetime routing protocol, to maximize the overall network lifetime, we find a path with the maximal remaining power after data transmission. With the link bandwidth and the desired amount of data transmitted, the consumption power is computed to obtain the remaining power of a mobile node. Accordingly, we can choose the path with the maximal predicted remaining power to maximize the overall network lifetime. In the simulation, we compare our high performance routing protocol with the AODV and LAWS in terms of throughput, rerouting (path breakage), and route lifetime. With respect to power consumption, we compare our proposed power-aware routing protocol with the POAD and PAMP in terms of the overall network lifetime and the ration of survival nodes to the all nodes.