Open AccessOptimal Transmission Radius for Flooding in Large Scale Sensor Networks
Author(s) -
Marco Z��iga,
Bhaskar Krishnamachari
Publication year - 2005
Publication title -
cluster computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.335
H-Index - 50
eISSN - 1573-7543
pISSN - 1386-7857
DOI - 10.1007/s10586-005-6182-8
Subject(s) - computer science , radius , flooding (psychology) , transmission (telecommunications) , computer network , network packet , wireless network , wireless sensor network , wireless , throughput , distributed computing , telecommunications , psychology , psychotherapist
One of the principal characteristics of large scale wireless sensor networks is their distributed, multi-hop nature. Due to this characteristic, applications such as query propagation rely regularly on network-wide flooding. Besides consuming energy and bandwidth resources, the flooded packet may keep the transmission medium within the network busy for too long, reducing overall network throughput. We analyze the impact of the transmission radius on the average settling time 驴 the time at which all nodes in the network finish transmitting theflooded packet. We show that for large wireless networks there exists a transmission range which minimizes the settling time 驴 corresponding to an optimal tradeoff between reception and contention times.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom