This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Self-Repairing Tree Topology Enabling Content-Based Routing in Mobile Ad Hoc Networks
August 2008 (vol. 7 no. 8)
pp. 946-960
ASCII Text
x 
 
Luca Mottola, Gianpaolo Cugola, Gian Pietro Picco, "A Self-Repairing Tree Topology Enabling Content-Based Routing in Mobile Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 7, no. 8, pp. 946-960, August, 2008.
 
 
BibTex
x
 
@article{ 10.1109/TMC.2007.70789,
author = {Luca Mottola and Gianpaolo Cugola and Gian Pietro Picco},
title = {A Self-Repairing Tree Topology Enabling Content-Based Routing in Mobile Ad Hoc Networks},
journal ={IEEE Transactions on Mobile Computing},
volume = {7},
number = {8},
issn = {1536-1233},
year = {2008},
pages = {946-960},
doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2007.70789},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Mobile Computing
TI - A Self-Repairing Tree Topology Enabling Content-Based Routing in Mobile Ad Hoc Networks
IS - 8
SN - 1536-1233
SP946
EP960
EPD - 946-960
A1 - Luca Mottola,
A1 - Gianpaolo Cugola,
A1 - Gian Pietro Picco,
PY - 2008
KW - Wireless communication
KW - Routing protocols
KW - Mobile Computing
VL - 7
JA - IEEE Transactions on Mobile Computing
ER -
 
Content-based routing (CBR) provides a powerful and flexible foundation for distributed applications. Its communication model, based on implicit addressing, fosters decoupling among the communicating components, therefore meeting the needs of many dynamic scenarios, including mobile ad hoc networks (MANETs). Unfortunately, the characteristics of the CBR model are only rarely met by available systems, which typically assume that application-level routers are organized in a tree-shaped network with a fixed topology. In this paper we present COMAN, a protocol to organize the nodes of a MANET in a tree-shaped network able to i) self-repair to tolerate the frequent topological reconfigurations characteristic of MANETs; ii) achieve this goal through repair strategies that minimize the changes that may impact the CBR layer exploiting the tree. COMAN is implemented and publicly available. Here we report about its performance in simulated scenarios as well as in real-world experiments. The results confirm that its characteristics enable reliable and efficient CBR on MANETs.

[1] Carleton University—MAODV Extensions for NS-2, www.sce.carleton.ca/wmccode.html, 2006.
[2] COMAN Web Page, www.elet.polimi.it/upload/mottolacoman, 2006.
[3] NS-2 Simulator Web Page, www.isi.edu/nsnamns, 2006.
[4] REDS Web Page, zeus.elet.polimi.itreds, 2006.
[5] R. Baldoni, R. Beraldi, G. Cugola, M. Migliavacca, and L. Querzoni, “Structure-Less Content-Based Routing in Mobile AdHoc Networks,” Proc. IEEE Int'l Conf. Pervasive Services (ICPS), 2005.
[6] B. Bollobas, Modern Graph Theory. Springer, 2002.
[7] E. Bommaiah, M. Liu, A. McAuley, and R. Talpade, AMRoute: Ad-Hoc Multicast Routing Protocol, IETF Internet draft, work in progress, www.ielf.org/internet-draftsdrafts-talpade-manet-amroute-00.txt , 1998.
[8] A. Bulut, A.K. Singh, and R. Vitenberg, “Distributed Data Streams Indexing Using Content-Based Routing Paradigm,” Proc. 19thIEEE Int'l Parallel and Distributed Processing Symp. (IPDPS), 2005.
[9] T. Camp, J. Boleng, and V. Davies, “A Survey of Mobility Models for Ad Hoc Network Research,” Wireless Comm. and Mobile Computing, vol. 2, no. 5, pp. 483-502, 2002.
[10] A. Carzaniga, D.S. Rosenblum, and A.L. Wolf, “Design and Evaluation of a Wide-Area Event Notification Service,” ACM Trans. Computer Systems, vol. 19, no. 3, Aug. 2001.
[11] K. Chen and K. Nahrstedt, “Effective Location-Guided Tree Construction Algorithms for Small Group Multicast in MANET,” Proc. IEEE INFOCOM '02, vol. 3, 2002.
[12] K. Chen and K. Nahrstedt, “Effective Location-Guided Overlay Multicast in Mobile Ad Hoc Networks,” Int'l J. Wireless and Mobile Computing, special issue on group comm. in ad hoc networks, 2005.
[13] Y. Chen and K. Schwan, “Opportunistic Overlays: Efficient Content Delivery in Mobile Ad Hoc Networks,” Proc. ACM/IFIP/Usenix Fifth Int'l Middleware Conf. (Middleware), 2005.
[14] C. Cordeiro, H. Gossain, and D. Agrawal, “Multicast over Wireless Mobile Ad Hoc Networks: Present and Future Directions,” IEEE Network, vol. 17, no. 1, 2003.
[15] P. Costa, G. Coulson, R. Gold, M. Lad, C. Mascolo, L. Mottola, G.P. Picco, T. Sivaharan, N. Weerasinghe, and S. Zachariadis, “The RUNES Middleware for Networked Embedded Systems and Its Application in a Disaster Management Scenario,” Proc. Fifth Int'l Conf. Pervasive Comm. (PerCom), 2007.
[16] P. Costa, M. Migliavacca, G.P. Picco, and G. Cugola, “Epidemic Algorithms for Reliable Content-Based Publish-Subscribe: An Evaluation,” Proc. 24th Int'l Conf. Distributed Computing Systems (ICDCS), 2004.
[17] P. Costa and G.P. Picco, “Semi-Probabilistic Content-Based Publish-Subscribe,” Proc. 25th Int'l Conf. Distributed Computing Systems (ICDCS), 2005.
[18] G. Cugola, D. Frey, A. Murphy, and G.P. Picco, “Minimizing the Reconfiguration Overhead in Content-Based Publish-Subscribe,” Proc. 19th ACM Symp. Applied Computing (SAC), 2004.
[19] G. Cugola and G.P. Picco, “REDS: A Reconfigurable Dispatching System,” Proc. Sixth Int'l Workshop Software Eng. and Middleware (SEM), 2006.
[20] S.K. Das, B.S. Manoj, and C.S.R. Murthy, “A Dynamic Core Based Multicast Routing Protocol for Ad Hoc Wireless Networks,” Proc. ACM MobiHoc, 2002.
[21] E.W. Dijkstra, “A Note on Two Problems in Connexion with Graphs,” Numerische Mathematik, vol. 1, 1959.
[22] P. Eugster, P. Felber, R. Guerraoui, and A.-M. Kermarrec, “TheMany Faces of Publish/Subscribe,” ACM Computing Surveys, vol. 2, no. 35, June 2003.
[23] J.J. Garcia-Luna-Aceves and E.L. Madruga, “The Core Assisted Mesh Protocol,” IEEE J. Selected Areas in Comm., vol. 17, no. 8, 1999.
[24] M. Ge, S.V. Krishnamurthy, and M. Faloutsos, “Application versus Network Layer Multicasting in Ad Hoc Networks: The ALMA Routing Protocol,” Ad Hoc Networks J., vol. 4, 2006.
[25] C. Gui and P. Mohapatra, “Efficient Overlay Multicast for Mobile Ad Hoc Networks,” Wireless Comm. and Networking, vol. 2, 2003.
[26] C. Gui and P. Mohapatra, “Scalable Multicasting in Mobile Ad-Hoc Networks,” Proc. IEEE INFOCOM, 2004.
[27] D. Heimbigner, “Adapting Publish/Subscribe Middleware to Achieve Gnutella-Like Functionality,” Proc. 16th ACM Symp. Applied Computing (SAC '01), pp. 176-181, 2001.
[28] Y. Huang and H. Garcia-Molina, “Publish/Subscribe in a Mobile Environment,” Proc. Second ACM Int'l Workshop Data Eng. for Wireless and Mobile Access (MOBIDE), 2001.
[29] Y. Huang and H. Garcia-Molina, “Publish/Subscribe Tree Construction in Wireless Ad-Hoc Networks,” Proc. Fourth Int'l Conf. Mobile Data Management (MDM), 2003.
[30] C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, and F. Silva, “Directed Diffusion for Wireless Sensor Networking,” IEEE/ACM Trans. Networking, vol. 11, no. 1, 2003.
[31] D.B. Johnson, D.A. Maltz, and J. Borch, DSR: The Dynamic SourceRouting Protocol for Multi-Hop Wireless Ad Hoc Networks. Addison-Wesley, 2001.
[32] S. Kalasapur, K. Senthivel, and M. Kumar, “Service Oriented Pervasive Computing for Emergency Response Systems,” Proc. Fourth IEEE Workshop Ubiquitous and Pervasive Health Care (UBICARE), 2006.
[33] J.B. Kruskal, “On the Shortest Spanning Subtree and the Traveling Salesman Problem,” Proc. Am. Math. Soc., vol. 7, 1956.
[34] S.J. Lee, W. Su, and M. Gerla, “On-Demand Multicast Routing Protocol in Multihop Wireless Mobile Networks,” ACM/Baltzer Mobile Networking and Applications, vol. 7, no. 6, 2002.
[35] S.J. Lee, W. Su, J. Hsu, M. Gerla, and R. Bagrodia, “A Performance Comparison Study of Ad Hoc Wireless Multicast Protocols,” Proc. IEEE INFOCOM '00, vol. 2, 2000.
[36] R. Meier and V. Cahill, “STEAM: Event-Based Middleware for Wireless Ad Hoc Network,” Proc. 22nd Int'l Conf. Distributed Computing Systems (ICDCS), 2002.
[37] G. Muhl, L. Fiege, and P. Pietzuch, Distributed Event-Based Systems. Springer, 2006.
[38] L. Opyrchal et al., “Exploiting IP Multicast in Content-Based Publish-Subscribe Systems,” Proc. Second IFIP/ACM Int'l Conf. Distributed Systems Platforms and Open Distributed Processing (Middleware), 2000.
[39] C. Perkins and E. Royer, “Ad Hoc On-Demand Distance Vector Routing,” Proc. Second IEEE Workshop Mobile Computing Systems and Applications (WMCSA), 1999.
[40] G.P. Picco, G. Cugola, and A. Murphy, “Efficient Content-Based Event Dispatching in the Presence of Topological Reconfigurations,” Proc. 23rd Int'l Conf. Distributed Computing Systems (ICDCS), 2003.
[41] E. Royer and C. Perkins, Multicast Ad Hoc On-Demand Distance Vector (MAODV) Routing, IETF Internet draft, work in progress, www.cs.escb.edu/~ebelding/txtmaodvid.ps, 2000.
[42] E.M. Royer and C.E. Perkins, “Multicast Operation of the Ad-Hoc On-Demand Distance Vector Routing Protocol,” Proc. ACM MobiCom, 1999.
[43] A.S. Tanenbaum, Computer Networks. Prentice Hall, 1996.
[44] K. Viswanath, K. Obraczka, and G. Tsudik, “Exploring Mesh and Tree-Based Multicast Routing Protocols for MANETs,” IEEE Trans. Mobile Computing, vol. 5, no. 1, 2006.
[45] C.W. Wu, Y.C. Tay, and C.-K. Toh, Ad Hoc Multicast Routing Protocol Utilizing Increasing ID-NumberS (AMRIS) Functional Specification, IETF Internet draft, work in progress, www.ietf.org/internet-draftsdraft-talpade-manet-amris-spec-00-txt , Nov. 1998.
[46] J. Xie, R.R. Talpade, A. McAuley, and M. Liu, “AMRoute: Ad Hoc Multicast Routing Protocol,” ACM/Baltzer Mobile Networking and Applications, vol. 7, no. 6, 2002.
[47] E. Yoneki and J. Bacon, “An Adaptive Approach to Content-Based Subscription in Mobile Ad Hoc Networks,” Proc. First Int'l Workshop Mobile Peer-to-Peer Computing (MP2P), 2004.
[48] E. Yoneki and J. Bacon, “Content-Based Routing with On-Demand Multicast,” Proc. Third Int'l Workshop Wireless Ad Hoc Networking (WWAN), 2004.
[49] J. Yoon, M. Liu, and B. Noble, “Sound Mobility Models,” Proc. ACM MobiCom, 2003.
[50] H. Zhou and S. Singh, “Content-Based Multicast (CBM) in Ad Hoc Networks,” Proc. ACM MobiHoc, 2000.

Index Terms:
Wireless communication, Routing protocols, Mobile Computing
Citation:
Luca Mottola, Gianpaolo Cugola, Gian Pietro Picco, "A Self-Repairing Tree Topology Enabling Content-Based Routing in Mobile Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 7, no. 8, pp. 946-960, Aug. 2008, doi:10.1109/TMC.2007.70789
Usage of this product signifies your acceptance of the Terms of Use.