Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
Computing on Anonymous Networks: Part II-Decision and Membership Problems
IEEE Transactions on Parallel and Distributed Systems
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
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Weak duplicate address detection in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Wireless Multimedia Communications: Networking Video, Voice and Data
Wireless Multimedia Communications: Networking Video, Voice and Data
Deterministic Radio Broadcasting
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Universal dynamic synchronous self-stabilization
Distributed Computing
Duplicate Address Detection and Autoconfiguration in OLSR
SNPD-SAWN '05 Proceedings of the Sixth International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing and First ACIS International Workshop on Self-Assembling Wireless Networks
PACMAN: passive autoconfiguration for mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
We consider duplicate address detection in wireless ad hoc networks under the assumption that addresses are unique in two hops neighborhood. Our approaches are based on the concepts of physical neighborhood views, that is, the information of physically connected nodes, and logical neighborhood views, which are built on neighborhood information propagated in networks. Since neighborhood information is identified by addresses, inconsistency of these two views might occur due to duplicate addresses. It is obvious that consistency of these two views on each node’s neighborhood is necessary for a network to have unique addresses, while the sufficiency depends on the types of information contained in neighborhood views. We investigate different definitions of neighborhood views and show that the traditional neighborhood information, neighboring addresses, is not sufficient for duplication detection, while the wireless nature of ad hoc networks provides useful neighborhood information.