Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
AODV Routing Protocol Implementation Design
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Towards mobility as a network control primitive
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Optimization Models for Determining Performance Benchmarks in Wireless Sensor Networks
SENSORCOMM '09 Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications
Energy spaced placement for bidirectional data flows in wireless sensor network
IEEE Communications Letters
Transmission range adaptation based energy efficient neighborhood discovery
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
An energy efficient adaptive HELLO algorithm for mobile ad hoc networks
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
| Hi-index | 0.00 |
This paper addresses mobility control routing in wireless networks. Given a data flow request between a source-destination pair, the problem is to move nodes towards the best placement, such that the performance of the network is improved. Our purpose is to find the best nodes selection depending on the minimization of the maximum distance that nodes have to travel to reach their final position. We propose a routing protocol, the Routing Protocol based on Controlled Mobility (RPCM), where the chosen nodes' path minimizes the total travelled distance to reach desirable position. Specifically, controlled mobility is intended as a new design dimension network allowing to drive nodes to specific best position in order to achieve some common objectives. The main aim of this paper is to show by simulation the effectiveness of controlled mobility when it is used as a new design dimension in wireless networks. Extensive simulations are conducted to evaluate the proposed routing algorithm. Results show how our protocol outperforms a well-known routing protocol, the Ad hoc On Demand Distance Vector routing (AODV), in terms of throughput, average end-to-end data packet delay and energy spent to send a packet unit.