Loading...
Please wait, while we are loading the content...
On the node-scheduling approach to topology control in ad hoc networks (2005)
| Content Provider | CiteSeerX |
|---|---|
| Author | Deb, Budhaditya |
| Description | In Proc. 6 th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC |
| Abstract | In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for routing purposes (usually determined by a minimum connected dominating set, MCDS) are kept active. However, a very low density resulting from switching off nodes can adversely affect the performance of data delivery due to three factors. First, our analysis shows that at low density, the average path length increases by a factor more than previously thought. Second, protocols such as the Hop-By-Hop Broadcast (HHB) reliability scheme (which relies on high network degree for optimum performance) suffer. Third, with limited buffers at nodes, the overhead is more pronounced to the extent of making the network unstable. Using probabilistic models, we derive the relationship between network density and overhead based on the above factors and find the density conditions for minimum power consumption. We also propose a, fully distributed and message-optimal node scheduling algorithm with a constant approximation bound based on the concept of Virtual Connected Dominating Sets. The scheme can asymptotically achieve optimal density conditions while adapting to different network parameters. |
| File Format | |
| Publisher Date | 2005-01-01 |
| Access Restriction | Open |
| Subject Keyword | Topology Control Reliable Packet Delivery Reliability Scheme Data Delivery Network Density High Network Degree Optimal Density Condition Low Density Node Scheduling Limited Buffer Minimum Connected Dominating Set Density Condition Node-scheduling Approach Average Path Length Increase Hop-by-hop Broadcast Message-optimal Node Optimum Performance Ad Hoc Network Minimum Set Virtual Connected Dominating Set Minimum Power Consumption Constant Approximation Bound Different Network Parameter Probabilistic Model |
| Content Type | Text |
| Resource Type | Conference Proceedings Article |
