Data networks
Multicluster, mobile, multimedia radio network
Wireless Networks
Routing in wireless/mobile ad-hoc networks via dynamic group construction
Mobile Networks and Applications
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
The bits and flops of the n-hop multilateration primitive for node localization problems
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Fair Scheduling with QoS Support in Ad Hoc Networks
LCN '02 Proceedings of the 27th Annual IEEE Conference on Local Computer Networks
GPS-Free Positioning in Mobile ad-hoc Networks
HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 9 - Volume 9
Traffic Analysis in Ad Hoc Networks Based on Location-Aware Clustering
ICDCSW '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Stability Aware Cluster Routing Protocol for mobile Ad-Hoc Networks
ICPADS '02 Proceedings of the 9th International Conference on Parallel and Distributed Systems
Channel Access-Based Self-Organized Clustering in Ad Hoc Networks
IEEE Transactions on Mobile Computing
Scalable routing strategies for ad hoc 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
ANMP: ad hoc network management protocol
IEEE Journal on Selected Areas in Communications
Scalable max-min fairness in wireless ad hoc networks
Ad Hoc Networks
| Hi-index | 0.00 |
The area covered by a mobile ad hoc network consists of obstacles that inhibit transmission and areas where communications can take place. Physical structures, such as buildings, that block transmission, or lakes, where forwarding nodes cannot be located, are permanent obstacles. Temporary obstacles are created as mobile nodes enter or leave an area. Our hypothesis is that the spaces between nearby obstacles are bottlenecks that inhibit the flows in the network. We partition the network into areas that are encompassed by obstacles and bottlenecks. All of the nodes in an area are treated as a single super node, and the bottlenecks between areas are the links between the super nodes. As individual nodes move, the flows and paths in the model change more slowly than the paths and flows between the individual nodes. We apply flow control algorithms to the model and perform admission control within a super node based on the flows that are assigned by the flow control algorithm. We apply the model to the Columbia University campus, and use max-min, fair bottleneck flow control to assign the flows. Our hypothesis is verified for this example.