DocumentCode
3304298
Title
Local Algorithms for Robust Mission Realization in Large-Scale Disconnected Networks
Author
Charpentier, Michel ; Bartos, Radim ; Li, Ying
Author_Institution
Dept. of Comput. Sci., Univ. of New Hampshire, Durham, NH, USA
fYear
2012
fDate
23-25 Aug. 2012
Firstpage
244
Lastpage
248
Abstract
Robustness and reliability in large-scale sensor networks present a triple challenge. First, the large scale (possibly compounded by the use of unreliable communication) makes failures -- transient and permanent -- unavoidable. Second, the difficulty of deploying such systems, especially in challenging environments, makes it next to impossible to replace failed nodes or rearrange surviving nodes after each failure. Third, the limited resources and capabilities of most sensor nodes prohibit elaborate, global/centralized approaches, especially in view of the potentially large number of nodes in the network. In this paper, we propose simple mechanisms to alleviate the effect of node failure in large-scale disconnected networks and show that beneficial global network properties can emerge from local rules achievable by simple nodes.
Keywords
telecommunication network reliability; wireless sensor networks; beneficial global network properties; global-centralized approaches; large-scale disconnected networks; large-scale sensor network reliability; large-scale sensor network robustness; local algorithm; local rules; node failure; permanent failures; robust mission realization; sensor nodes; surviving nodes; transient failures; Computational modeling; Context; Maintenance engineering; Protocols; Robustness; Trajectory; Wireless sensor networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Network Computing and Applications (NCA), 2012 11th IEEE International Symposium on
Conference_Location
Cambridge, MA
Print_ISBN
978-1-4673-2214-0
Type
conf
DOI
10.1109/NCA.2012.48
Filename
6299101
Link To Document