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
Asymptotically optimal geometric mobile ad-hoc routing
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Minimum energy disjoint path routing in wireless ad-hoc networks
Proceedings of the 9th annual international conference on Mobile computing and networking
The bin-covering technique for thresholding random geometric graph properties
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Topology control in wireless ad hoc and sensor networks
ACM Computing Surveys (CSUR)
Asymptotic critical transmission radius for greedy forward routing in wireless ad hoc networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Variable-Range Transmission Power Control in Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
The capacity of wireless networks
IEEE Transactions on Information Theory
Position-based routing in ad hoc networks
IEEE Communications Magazine
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Transmission power control in wireless ad hoc networks: challenges, solutions and open issues
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
This paper presents a model for studying the effect of transmission range control on route efficiency in ad hoc networks, both in terms of maximal throughput and minimal energy expenditure. We show that allowing for per-packet variable power control greatly improves the average efficiency of multi-hop, unicast transmissions. For two-level power control, we compute near optimal values for the two transmission radii to maximize performance. A new local, position-based routing protocol is designed based on partial network information. We show that as nodes have more information about the network, better routing decisions are made. We find a threshold in location information such that when a node knows the location of other nodes within a certain distance of itself, it makes high quality, local forwarding decisions.