An algorithm for reconnecting wireless sensor network partitions

Authors:
Gianluca Dini;Marco Pelagatti;Ida Maria Savino
Affiliations:
Dept. of Ingegneria della Informazione, University of Pisa, Pisa, Italy;Dept. of Ingegneria della Informazione, University of Pisa, Pisa, Italy;Dept. of Ingegneria della Informazione, University of Pisa, Pisa, Italy
Venue:
EWSN'08 Proceedings of the 5th European conference on Wireless sensor networks
Year:
2008

Citing 8
Cited 2

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Denial of Service in Sensor Networks

Computer
The nesC language: A holistic approach to networked embedded systems

PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
TOSSIM: accurate and scalable simulation of entire TinyOS applications

Proceedings of the 1st international conference on Embedded networked sensor systems
ASCENT: Adaptive Self-Configuring sEnsor Networks Topologies

IEEE Transactions on Mobile Computing
Detecting cuts in sensor networks

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
The emergence of networking abstractions and techniques in TinyOS

NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1

Energy conservation in wireless sensor networks: A survey

Ad Hoc Networks
Data Collection in Wireless Sensor Networks with Mobile Elements: A Survey

ACM Transactions on Sensor Networks (TOSN)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a Wireless Sensor Network, sensor nodes may fail for several reasons and the network may split into two or more disconnected partitions. This may deteriorate or even nullify the usefulness and effectiveness of the network. Therefore, repairing partitions is a priority. In this paper we present a method to repair network partitions by using mobile nodes. By reasoning upon the degree of connectivity with neighbours, a mobile node finds the proper position where to stop in order to re-establish connectivity. Factors influencing the method performance are singled out and criteria for their selection are discussed. Simulations show that the proposed method is effective and efficient notwithstanding packet loss.