NDLI: Can a packet walk straight through a field of randomly dying location-unaware wireless nodes?

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

Wireless link scheduling under a graded SINR interference model

A 3d-localization and terrain modeling technique for wireless sensor networks

Passive localization using rotating anchor pairs in wireless sensor networks

On self-organization in MANETs

A constant approximation algorithm for link scheduling in arbitrary networks under physical interference model

An improved approximation algorithm for data aggregation in multi-hop wireless sensor networks

Spatio-temporal monitoring using contours in large-scale wireless sensor networks

On the multicast throughput capacity of network coding in wireless ad-hoc networks

Can a packet walk straight through a field of randomly dying location-unaware wireless nodes?

Reactive jamming attacks in multi-radio wireless sensor networks: an efficient mitigating measure by identifying trigger nodes

On a locally minimum cost forwarding game

Can a packet walk straight through a field of randomly dying location-unaware wireless nodes?

Content Provider	ACM Digital Library
Author	Spasojević, Predrag Kokalj-Filipović, Silvija Yates, Roy D.
Abstract	A protocol, dubbed BeSpoken, steers data transmissions along a straight path called a spoke through a wireless sensor network with many location-unaware nodes. BeSpoken implements a simple, spatially recursive communication process, where a set of control packets and a data packet are exchanged among daisy-chained relays that constitute the spoke. It directs data transmissions by randomly selecting relays from crescent-shaped areas along the spoke axis created by intersecting transmission ranges of control and data packets. To specify design rules for protocol parameters that minimize energy consumption while ensuring that spokes propagate far enough and have a limited wobble with respect to the spoke axis, our model of the spoke propagation matches the protocol parameters to the density of network nodes, assuming that nodes are spatially distributed as a Poisson point process of known uniform intensity. To avoid this requirement, we propose and characterize an adaptive mechanism that ensures desired spoke propagation in a network of arbitrary density. This necessitates a qualitatively new protocol model used to evaluate the spoke propagation under both the basic and the adaptive protocol. The introduced adaptive mechanism repairs the spoke when the crescent-shaped area is empty which may occur in the case of network thinning and as a result of random or arbitrary sensor death. Our analytical and simulation results demonstrate that the adaptive BeSpoken creates longer spokes both in networks with uniform distribution of nodes and in networks with holes. In addition, the adaptive protocol is significantly less sensitive to changes in the distribution of network nodes and their density.
Starting Page	57
Ending Page	66
Page Count	10
File Format	PDF
ISBN	9781605585239
DOI	10.1145/1540343.1540353
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2009-05-18
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Wireless Stochastic model Location-unaware nodes Adaptive Directional propagation Random walk Network thinning
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

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