Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks

Details Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks

2011-03-09

arxiv.org/abs/1103.1771v1

Computer Science

Data Structures and Algorithms

extended version of accepted submission to SEA 2011

Scientific paper

We propose two novel algorithms for distributed and location-free boundary recognition in wireless sensor networks. Both approaches enable a node to decide autonomously whether it is a boundary node, based solely on connectivity information of a small neighborhood. This makes our algorithms highly applicable for dynamic networks where nodes can move or become inoperative. We compare our algorithms qualitatively and quantitatively with several previous approaches. In extensive simulations, we consider various models and scenarios. Although our algorithms use less information than most other approaches, they produce significantly better results. They are very robust against variations in node degree and do not rely on simplified assumptions of the communication model. Moreover, they are much easier to implement on real sensor nodes than most existing approaches.

Affiliated with

Also associated with

No associations

Rating

Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-644342