Abstract
In clustered ad hoc networks, it is often required that a clusterhead, a leader of cluster, send a message to all its neighbor clusterheads. One simple approach is to use a flooding scheme in which every bridge node receiving a message simply relays it only if it receives the message for the first time. However, the flooding tends to degrade network efficiency severely because many bridges relay the message unnecessarily, causing neighbor clusterheads to receive multiple copies of the same message along different paths. A distributed self-pruning algorithm proposed in this paper attacks this problem.
This research was supported by the MIC(Ministry of Information and Communication), Korea, under the ITRC(Information Technology Research Center) support program supervised by the IITA(Institute of Information Technology Assessment).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chiiang, T.-C., Wu, P.-Y., Huang, Y.-M.: A limited flooding schmeme for mobile ad hoc networks. In: IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, Aug. 2005, vol. 3, pp. 473–478 (2005)
Jacquet, P., Muhlethaler, P., Clausen, T., Laouiti, A., Qayyum, A., Viennot, L.: Optimized link state routing protocol for ad hoc networks. In: IEEE International Multi Topic Conference (2001)
Kwon, T.J., Gerla, M.: Efficient flooding with passive clustering(PC) in ad hoc networks. ACM Computer Communication Review 32(1), 44–56 (2002)
Ngoc, D.M., Oh, H.: A Group Dynamic Source Routing Protocol for Ad Hoc Networks. In: Proc. 1st IFOST, Oct. 2006, pp. 134–137 (2006)
Oh, H., Yun, S.-Y.: Proactive cluster-based distance-vector(PCDV) routing protocol in mobile ad hoc networks. To be published, IEICE Trans. On Communications
Oh, H., Park, H.S.: Communication architecture and protocols for broadcast-type mobile multimedia ad hoc networks. In: Proceedings, MILCOM 2002, Oct. 2002, vol. 1, pp. 442–447 (2002)
Peng, W., Lu, X.-C.: On the Reduction of Broadcast Redundancy in Mobile Ad Hoc Networks. In: Proc. First Ann. Workshop Mobile and Ad Hoc Networking and Computing, Aug. 2000, pp. 129–130 (2000)
UCLA Parallel Computing Laboratory and Wireless Adaptive Mobility Laboratory. GloMoSim: A Scalable Simulation Environment for Wireless and Wired Network Systems, http://pcl.cs.ucla.edu/projects/glomosim
Stojmenovic, I., Seddigh, M., Zunic, J.: Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks. IEEE Transactions on Parallel and Distributed Systems 13(1), 14–25 (2002)
Wu, J., Lou, W.: Forward-Node-Set-Based Broadcast in Clustered Mobile Ad Hoc Networks. Wireless Networks and Mobile Computing (special issue on Algorithmic, Geometric, Graph, Combinational, and Vector) 3(2), 155–173 (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Yun, S.Y., Oh, H. (2007). Distributed Self-Pruning(DSP) Algorithm for Bridges in Clustered Ad Hoc Networks. In: Lee, YH., Kim, HN., Kim, J., Park, Y., Yang, L.T., Kim, S.W. (eds) Embedded Software and Systems. ICESS 2007. Lecture Notes in Computer Science, vol 4523. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72685-2_64
Download citation
DOI: https://doi.org/10.1007/978-3-540-72685-2_64
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72684-5
Online ISBN: 978-3-540-72685-2
eBook Packages: Computer ScienceComputer Science (R0)