By Topic

On Broadcasting in Wireless Sensor Networks with Irregular and Dynamic Radio Coverage

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Li-Chun Hsu ; National Tsing Hua University, Taiwan ; Chung-Ta King ; Amit Banerjee

Broadcast in radio-based wireless networks has been a difficult problem. When a node broadcasts, all nodes within its radio coverage will attempt to relay the message by rebroadcasting, causing excessive radio communication in the region that leads to the broadcast storm problem. Most previous solutions assumed a perfect radio condition with a static, circular coverage. However, in real situations, radio signals are very dynamic and irregular in their coverage. This is especially true for wireless sensor networks, which usually employ low quality radio modules to reduce the cost. Assuming no location information is available, we approach the problem in this paper from two aspects: space and time. To solve the irregularity in space in radio coverage, we propose a scheme that is able to find the neighbors on the rim of the irregular radio coverage region to narrow down the choices of the forwarders. To solve the dynamic in radio coverage, we consider an on-demand, stateless strategy to reduce the overhead of maintaining the state information. Through simulation, we compare the resultant algorithm, called RIM, with Double-Covered Broadcast (DCB) [10], one of the best algorithms proposed so far. The results show that under dense deployment and irregular and dynamic radio coverage, our algorithm performs better.

Published in:

2007 International Conference on Parallel Processing (ICPP 2007)

Date of Conference:

10-14 Sept. 2007