Paper Info
Title
Node Relocation Algorithms For Improving Communications Quality In Ad Hoc Networks
Abstract
We present node relocation algorithms to achieve better communications quality in a mobile wireless ad hoc network. Our aim is to manage the ad hoc network autonomously. The communications quality is improved by decreasing distance from the source to the destination node in the network. A problem is defined as how to relocate relay nodes in the network to minimize distance in the network and moreover to minimize the distance of moving the nodes. The shorter moving distance of a node leads to the less battery consumption by the moving. We propose two algorithms, i.e., one that was centralized and a decentralized one. The former is based on the minimum spanning tree algorithm. Since the latter is not solved efficiently, we present an approximation algorithm using the distributed election algorithm.
Year
DOI
Venue
2009
10.1109/ISADS.2009.5207393
ISADS 2009: 2009 INTERNATIONAL SYMPOSIUM ON AUTONOMOUS DECENTRALIZED SYSTEMS, PROCEEDINGS
Keywords
Field
DocType
mobile ad hoc networks,minimum spanning tree algorithm,ad hoc networks,quality of service,minimum spanning tree,bandwidth,informatics,ad hoc network,approximation algorithms,wireless ad hoc network,mobile communication,protective relaying
Mobile ad hoc network,Relocation,Approximation algorithm,Computer science,Computer network,Quality of service,Algorithm,Optimized Link State Routing Protocol,Wireless ad hoc network,Relay,Minimum spanning tree,Distributed computing
Conference
Citations 
PageRank 
References 
0
0.34
7
Authors
2
Name
Order
Citations
PageRank
Yoko Furuzumi100.68
Yukikazu Nakamoto27921.50