NDLI: On the node-scheduling approach to topology control in ad hoc networks

Please wait, while we are loading the content...

Distributed low-cost backbone formation for wireless ad hoc networks

Toward resilient security in wireless sensor networks

Interference-aware topology control and QoS routing in multi-channel wireless mesh networks

A distributed coordination framework for wireless sensor and actor networks

Characterizing achievable multicast rates in multi-hop wireless networks

Localization and routing in sensor networks by local angle information

'Openness' and the public airwaves

Efficient geographic routing in multihop wireless networks

Reliable bursty convergecast in wireless sensor networks

Mobility improves coverage of sensor networks

Low-coordination topologies for redundancy in sensor networks

Hybrid sensor networks: a small world

Temporal properties of low power wireless links: modeling and implications on multi-hop routing

Toward the sensor network macroscope

On the node-scheduling approach to topology control in ad hoc networks

The feasibility of launching and detecting jamming attacks in wireless networks

Modelling and performance analysis of the distributed scheduler in IEEE 802.16 mesh mode

Power balanced coverage-time optimization for clustered wireless sensor networks

Distributed dynamic scheduling for end-to-end rate guarantees in wireless ad hoc networks

Easily-managed and topology-independent location service for self-organizing networks

Link-layer salvaging for making routing progress in mobile ad hoc networks

TCP over multihop 802.11 networks: issues and performance enhancement

Deploying sensor networks with guaranteed capacity and fault tolerance

A cross-layer optimization of gnutella for mobile ad hoc networks

Least privilege and privilege deprivation: towards tolerating mobile sink compromises in wireless sensor networks

Maximum-lifetime routing algorithms for networks with omnidirectional and directional antennas

On maximizing the lifetime of distributed information in ad-hoc networks with individual constraints

An efficient scheme for authenticating public keys in sensor networks

Stationary distributions of random walk mobility models for wireless ad hoc networks

Inducing spatial clustering in MAC contention for spread spectrum ad hoc networks

Cross-layer rate control for end-to-end proportional fairness in wireless networks with random access

Sextant: a unified node and event localization framework using non-convex constraints

A secure ad-hoc routing approach using localized self-healing communities

TCP with adaptive pacing for multihop wireless networks

Analysis of hop-distance relationship in spatially random sensor networks

Towards commercial mobile ad hoc network applications: a radio dispatch system

Minimum power configuration in wireless sensor networks

Timed grid routing (TIGR) bites off energy

On the end-to-end call acceptance and the possibility of deterministic QoS guarantees in ad hoc wireless networks

Scalable location services for hierarchically organized mobile ad hoc networks

Efficient gathering of correlated data in sensor networks

Minimum energy reliable paths using unreliable wireless links

On the node-scheduling approach to topology control in ad hoc networks

Content Provider	ACM Digital Library
Author	Deb, Budhaditya Nath, Badri
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.
Starting Page	14
Ending Page	26
Page Count	13
File Format	PDF
ISBN	1595930043
DOI	10.1145/1062689.1062693
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2005-05-25
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Ad-hoc networks Minimum virtual dominating sets Topology control Node scheduling Reliable packet delivery
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

On the node-scheduling approach to topology control in ad hoc networks (2005)

On the node-scheduling approach to topology control in ad hoc networks (2005)

Topology management in ad hoc networks

Virtual backbone based on MCDS for topology control in wireless ad hoc networks

Adapting connected d-hop dominating sets to topology changes in wireless ad hoc networks

Use of minimum node velocity based stable connected dominating sets for mobile ad hoc networks.

Efficient topology control in wireless networks using minimum Backbone updates

Layered backpressure scheduling for delay reduction in ad hoc networks

An Algorithm to Determine the Sequence of Stable Connected Dominating Sets in Mobile Ad Hoc Networks

On the node-scheduling approach to topology control in ad hoc networks

Similar Documents

On the node-scheduling approach to topology control in ad hoc networks (2005)

On the node-scheduling approach to topology control in ad hoc networks (2005)

Topology management in ad hoc networks

Virtual backbone based on MCDS for topology control in wireless ad hoc networks

Adapting connected d-hop dominating sets to topology changes in wireless ad hoc networks

Use of minimum node velocity based stable connected dominating sets for mobile ad hoc networks.

Efficient topology control in wireless networks using minimum Backbone updates

Layered backpressure scheduling for delay reduction in ad hoc networks

An Algorithm to Determine the Sequence of Stable Connected Dominating Sets in Mobile Ad Hoc Networks

On the node-scheduling approach to topology control in ad hoc networks