Log-logarithmic selection resolution protocols in a multiple access channel
SIAM Journal on Computing
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Computer networks (3rd ed.)
An introduction to distributed algorithms
An introduction to distributed algorithms
The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Adaptive protocols for information dissemination in wireless sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Next century challenges: mobile networking for “Smart Dust”
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
A Highly Available Local Leader Election Service
IEEE Transactions on Software Engineering
Leader election algorithms for mobile ad hoc networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
A mutual exclusion algorithm for ad hoc mobile networks
Wireless Networks
Comparison of broadcasting techniques for mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Distributed Algorithms
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Uniform Leader Election Protocols for Radio Networks
IEEE Transactions on Parallel and Distributed Systems
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A Distributed Mutual Exclusion Algorithm for Mobile Ad-Hoc Networks
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
MobiCom poster: top five myths about the energy consumption of wireless communication
ACM SIGMOBILE Mobile Computing and Communications Review
Lightweight time synchronization for sensor networks
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Understanding packet delivery performance in dense wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Coping with irregular spatio-temporal sampling in sensor networks
ACM SIGCOMM Computer Communication Review
Fine-grained network time synchronization using reference broadcasts
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
A robust data delivery protocol for large scale sensor networks
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
IEEE 802.11 Wireless Local Area Networks
IEEE Communications Magazine
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Self-selecting reliable paths for wireless sensor network routing
Computer Communications
Biologically Inspired Self Selective Routing with Preferred Path Selection
Bio-Inspired Computing and Communication
Proceedings of the 4th Annual International Conference on Wireless Internet
| Hi-index | 0.00 |
We have identified a fundamental operator in wireless networks that we named the local leader election in which the goal is to select a node in a spatially close neighborhood. We present a simple and efficient solution to the local leader election problem by making use of both: (i) implicit synchronization points, commonly observable by all nodes in the same neighborhood, and (ii) the prioritized backoff delay, dependent on the desired probability of each node becoming a leader. We then show that both flooding and routing are instances of the local leader election problem, so our general solution naturally applies. By relating the backoff delay to the signal strength of the received packet, we have designed a variant of flooding named Signal Strength Aware Flooding (SSAF) that can improve its efficiency. By using a different metric to derive the backoff delay, we have designed a new generation wireless routing protocol, that we named the Routeless Routing protocol that possesses several interesting properties.