REFERENCES

AWERBUCH B, BRINKMANN A, SCHEIDELER C. “Anycasting in adversarial systems: Routing and admission control”. In 30th International Colloquium on Automata, Languages, and Programming (ICALP); Eindhoven, Netherlands; 2003.

BALLARDIE T, FRANCIS P, CROWCROFT J “Core based trees (CBT)”. SIGCOMM Comput Commun Rev 1993;23(4):85–95.

BOSE P, MORIN P, STOJMENOVIC I, URRUTIA J. “Routing with guaranteed delivery in Ad hoc wireless networks”. Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM'99); New York, NY, USA; 1999. pp. 48–55.

BOSE P, MORIN P, STOJMENOVIC I, URRUTIA J. “Routing with guaranteed delivery in Ad hoc wireless networks”. Wirel Netw 2001;7(6):609–616.

CHEN S, DOW C, CHEN S, LIN J, HWANG S. “An efficient anycasting scheme in ad-hoc wireless networks”. Consumer Communications and Networking Conference; Las Vegas, Nevada, USA; 2004. pp. 178–183.

DAS S, PUCHA H, HU YC. “Distributed hashing for scalable multicast in wireless Ad hoc networks”. IEEE Trans Parallel Distrib Syst 2008;19(3):347–362.

DATTA S, STOJMENOVIC I, WU J. “Internal node and shortcut based routing with guaranteed delivery in wireless networks”. Cluster Comput 2002;5(2):169–178.

DEERING SE, CHERITON DR. “Multicast routing in datagram internetworks and extended lans”. ACM Trans Comput Syst 1990;8(2):85–110.

DEERING S, ESTRIN D, FARINACCI D, JACOBSON V, LIU CG, WEI L. “An architecture for wide-area multicast routing”. SIGCOMM Comput ...

Get Wireless Sensor and Actuator Networks: Algorithms and Protocols for Scalable Coordination and Data Communication now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.