On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Power consumption in packet radio networks
Theoretical Computer Science
On the minimum node degree and connectivity of a wireless multihop network
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Algorithmic aspects of topology control problems for ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Fault tolerant deployment and topology control in wireless networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Topology management in ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
The K-Neigh Protocol for Symmetric Topology Control in Ad Hoc Networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
The Critical Transmitting Range for Connectivity in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
TAP: Traffic-aware topology control in on-demand ad hoc networks
Computer Communications
Energy-aware topology control for wireless sensor networks using memetic algorithms
Computer Communications
Power control based topology construction for the distributed wireless sensor networks
Computer Communications
CLTC: A Cluster-Based Topology Control Framework for Ad Hoc Networks
IEEE Transactions on Mobile Computing
An SPT-based topology control algorithm for wireless ad hoc networks
Computer Communications
Epoch distance of the random waypoint model in mobile ad hoc networks
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
A minimum-energy path-preserving topology-control algorithm
IEEE Transactions on Wireless Communications
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
A mobility-based framework for adaptive clustering in wireless ad hoc networks
IEEE Journal on Selected Areas in Communications
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
Power-stepped protocol: enhancing spatial utilization in a clustered mobile ad hoc network
IEEE Journal on Selected Areas in Communications
Mobility control and its applications in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Connectivity control methods and decision algorithms using neural network in decentralized networks
ISNN'10 Proceedings of the 7th international conference on Advances in Neural Networks - Volume Part I
Swarm mobility and its impact on performance of routing protocols in MANETs
Computer Communications
Neighbor supported reliable multipath multicast routing in MANETs
Journal of Network and Computer Applications
Sleep-based topology control in the Ad Hoc networks by using fitness aware learning automata
Computers & Mathematics with Applications
UAV fleet area coverage with network connectivity constraint
Proceedings of the 11th ACM international symposium on Mobility management and wireless access
| Hi-index | 0.24 |
This paper proposes two topology control algorithms - ABsolute Distance-based (ABD) and PRedictive Distance-based (PRD), which adjust the transmission range of individual nodes in a MANET to achieve good network throughput, particularly under correlated node movements as in a vehicular environment. Both algorithms attempt to maintain the number of logical neighbors between two predefined thresholds. The ABD algorithm uses the absolute distance as the neighbor selection criteria while the PRD algorithm incorporates mobility information to extend the neighbor lifetime, and hence a less chance of broken links. A simple expression of saturated end-to-end throughput is presented as a function of path availability which depends on the average transmission range, the network connectivity, and the probability of broken links. Based on the simulation results, it was found out the transmission range can only be increased to a certain value to prolong the next-hop neighbor. Beyond such value, the MAC interference becomes a more dominant factor over the end-to-end throughput than routing overheads or the effects of broken links. Consequently, using a higher transmission range will only decrease the throughput. Under Street mobility which has correlated node movement, PRD algorithm can take advantage of such correlation and achieves higher path availability and end-to-end throughput than ABD algorithm.