Flooding for reliable multicast in multi-hop ad hoc networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
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
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Freenet: a distributed anonymous information storage and retrieval system
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
Adaptive demand-driven multicast routing in multi-hop wireless ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
COCA: A secure distributed online certification authority
ACM Transactions on Computer Systems (TOCS)
A Middleware Infrastructure for Active Spaces
IEEE Pervasive Computing
Pushing the Limits of Multicast in Ad Hoc Networks
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Building intrusion tolerant applications
SSYM'99 Proceedings of the 8th conference on USENIX Security Symposium - Volume 8
Revisiting the TTL-based controlled flooding search: optimality and randomization
Proceedings of the 10th annual international conference on Mobile computing and networking
Optimal Controlled Flooding Search in a Large Wireless Network
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
A survey on peer-to-peer key management for mobile ad hoc networks
ACM Computing Surveys (CSUR)
Controlled flooding search in a large network
IEEE/ACM Transactions on Networking (TON)
Distributed aggregation service for mobile wireless ad hoc sensor networks
International Journal of Mobile Communications
Analysis and design of a k-Anycast communication model in IPv6
Computer Communications
Service discovery based on anycasting in mobile ad-hoc networks
Proceedings of the 2nd international workshop on Agent-oriented software engineering challenges for ubiquitous and pervasive computing
An efficient anycast scheme for discovering K services in mobile ad-hoc networks
Proceedings of the 5th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Efficiency of Search Methods in Dynamic Wireless Networks
Wireless Systems and Mobility in Next Generation Internet
Discovering timely information in MANETs
Computers & Mathematics with Applications
Robust and efficient communication overlays for trust authority computations
SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
A grid-based manycast scheme for large mobile ad hoc networks
ICOIN'06 Proceedings of the 2006 international conference on Information Networking: advances in Data Communications and Wireless Networks
A service discovery protocol with maximal area disjoint paths for mobile ad hoc networks
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
Hi-index | 0.00 |
The characteristics of ad hoc networks naturally encourage the deployment of distributed services. Although current networks implement group communication methods, they do not support the needs of a mobile node that must locate one or more distributed servers. A node should not need detailed knowledge of network topology to choose servers with which it can communicate efficiently.To this end, manycast is a group communication scheme that enables communication with an arbitrary (user specified) number of group members. Anycast and multicast communication are special cases of manycast in which the target number of group members is one and infinity, respectively. We present manycast and discuss its use as a communication primitive, with specific attention to ad hoc networks. We advocate manycast support at the network layer. A manycast routing protocol enables an application to contact several nearby network nodes that implement a distributed service.We analyze some approaches to manycast, including some application layer implementations. This evaluation supports our claim that manycast must be implemented in the network layer for effective operation in ad hoc networks. We present several extensions to ad hoc routing protocols that can provide manycast support with minimal implementation effort. Through analysis and extensive simulation, we explore the behavior of these approaches to manycast, finally providing recommendations to implementors.