A comparison of epidemic algorithms in wireless sensor networks

Cataloged from PDF version of article.We consider the problem of reliable data dissemination in the context of wireless sensor networks. For some application scenarios, reliable data dissemination to all nodes is necessary for propagating code updates, queries, and other sensitive information in wireless sensor networks. Epidemic algorithms are a natural approach for reliable distribution of information in such ad hoc, decentralized, and dynamic environments. In this paper we show the applicability of epidemic algorithms in the context of wireless sensor environments, and provide a comparative performance analysis of the three variants of epidemic algorithms in terms of message delivery rate, average message latency, and messaging overhead on the network. © 2006 Elsevier B.V. All rights reserved

A comparison of epidemic algorithms in wireless sensor networks

We consider the problem of reliable data dissemination in the context of wireless sensor networks. For some application scenarios, reliable data dissemination to all nodes is necessary for propagating code updates, queries, and other sensitive information in wireless sensor networks. Epidemic algorithms are a natural approach for reliable distribution of information in such ad hoc, decentralized, and dynamic environments. In this paper we show the applicability of epidemic algorithms in the context of wireless sensor environments, and provide a comparative performance analysis of the three variants of epidemic algorithms in terms of message delivery rate, average message latency, and messaging overhead on the network. © 2006 Elsevier B.V. All rights reserved

Epcast: Controlled Dissemination in Human-based Wireless Networks by means of Epidemic Spreading Models

Epidemics-inspired techniques have received huge attention in recent years from the distributed systems and networking communities. These algorithms and protocols rely on probabilistic message replication and redundancy to ensure reliable communication. Moreover, they have been successfully exploited to support group communication in distributed systems, broadcasting, multicasting and information dissemination in fixed and mobile networks. However, in most of the existing work, the probability of infection is determined heuristically, without relying on any analytical model. This often leads to unnecessarily high transmission overheads. In this paper we show that models of epidemic spreading in complex networks can be applied to the problem of tuning and controlling the dissemination of information in wireless ad hoc networks composed of devices carried by individuals, i.e., human-based networks. The novelty of our idea resides in the evaluation and exploitation of the structure of the underlying human network for the automatic tuning of the dissemination process in order to improve the protocol performance. We evaluate the results using synthetic mobility models and real human contacts traces

Beaconing Approaches in Vehicular Ad Hoc Networks: A Survey

A Vehicular Ad hoc Network (VANET) is a type of wireless ad hoc network that facilitates ubiquitous connectivity between vehicles in the absence of fixed infrastructure. Beaconing approaches is an important research challenge in high mobility vehicular networks with enabling safety applications. In this article, we perform a survey and a comparative study of state-of-the-art adaptive beaconing approaches in VANET, that explores the main advantages and drawbacks behind their design. The survey part of the paper presents a review of existing adaptive beaconing approaches such as adaptive beacon transmission power, beacon rate adaptation, contention window size adjustment and Hybrid adaptation beaconing techniques. The comparative study of the paper compares the representatives of adaptive beaconing approaches in terms of their objective of study, summary of their study, the utilized simulator and the type of vehicular scenario. Finally, we discussed the open issues and research directions related to VANET adaptive beaconing approaches.Ghafoor, KZ.; Lloret, J.; Abu Bakar, K.; Sadiq, AS.; Ben Mussa, SA. (2013). Beaconing Approaches in Vehicular Ad Hoc Networks: A Survey. Wireless Personal Communications. 73(3):885-912. doi:10.1007/s11277-013-1222-9S885912733ITS-Standards (1996) Intelligent transportation systems, U.S. Department of Transportation, http://www.standards.its.dot.gov/about.aspCheng, L., Henty, B., Stancil, D., Bai, F., & Mudalige, P. (2005). Mobile vehicle-to-vehicle narrow-band channel measurement and characterization of the 5.9 Ghz dedicated short range communication (DSRC) frequency band. IEEE Transactions on Selected Areas in Communications, 25(8), 1501–1516.van Eenennaam, E., Wolterink, K., Karagiannis, G., & Heijenk, G. (2009). Exploring the solution space of beaconing in vanets. In Proceedings of the 2009 IEEE international vehicular networking conference, Tokyo (pp. 1–8).Torrent-Moreno, M. (2007). Inter-vehicle communications: Assessing information dissemination under safety constraints. In Proceedings of the 2007 IEEE conference wireless on demand network systems and services, Austria (pp. 59–64).Lloret, J., Canovas, A., Catalá, A., & Garcia, M. (2012). Group-based protocol and mobility model for vanets to offer internet access. Journal of Network and Computer Applications 2224–2245 doi: 10.1016j.jnca.2012.02.009 .Nzouonta, J., Rajgure, N., Wang, G., & Borcea, C. (2009). Vanet routing on city roads using real-time vehicular traffic information. IEEE Transactions on Vehicular Technology, 58(7), 3609–3626.Fukui, R., Koike, H., & Okada, H. (2002). Dynamic integrated transmission control(ditrac) over inter-vehicle communications. In Proceedings of the 2002 IEEE vehicular technology conference, Birmingham (pp. 483–487).Schmidt, R., Leinmuller, T., Schoch, E., Kargl, F., & Schafer, G. (2010). Exploration of adaptive beaconing for efficient intervehicle safety communication. IEEE Network, 24(1), 14–19.Ghafoor, K., Bakar, K., van Eenennaam, E., Khokhar, R., Gonzalez, A. A fuzzy logic approach to beaconing for vehicular ad hoc networks, Accepted for publication in Telecommunication Systems Journal.Ghafoor, K., & Bakar, K. (2010). A novel delay and reliability aware inter vehicle routing protocol. Network Protocols and Algorithms, 2(2), 66–88.Mittag, J., Thomas, F., Härri, J., & Hartenstein, H. (2009). A comparison of single-and multi-hop beaconing in vanets. In Proceedings of the 2009 ACM international workshop on vehicular internetworking, Beijing (pp. 69–78).Sommer, C., Tonguz, O., & Dressler, F. (2010). Adaptive beaconing for delay-sensitive and congestion-aware traffic information systems. In Proceedings of the 2010 IEEE international vehicular networking conference (VNC), New Jersey (pp. 1–8).Guan, X., Sengupta, R., Krishnan, H., & Bai, F. (2007). A feedback-based power control algorithm design for vanet. In Proceedings of the 2007 IEEE international conference on mobile networking for vehicular environments, USA (pp. 67–72).AL-Hashimi, H., Bakar, K., & Ghafoor, K. (2011). Inter-domain proxy mobile ipv6 based vehicular network. Network Protocols and Algorithms, 2(4), 1–15.Rawat, D., Popescu, D., Yan, G., & Olariu, S. (2011). Enhancing vanet performance by joint adaptation of transmission power and contention window size. Transactions on Parallel and Distributed Systems, 22(9), 1528–1535.European-ITS (2009) Eits-technical report 102 638 v1.1.1, European Telecommunications Standards Institute (ETSI), http://www.etsi.org/WebSite/homepage.aspxNHTSA, I. Joint program office”, report to congress on the national highway traffic safety administration its program, program progress during 1992–1996 and strategic plan for 1997–2002, US Department of Transportation, Washington, DC.Godbole, D., Sengupta, R., Misener, J., Kourjanskaia, N., & Michael, J. (1998). Benefit evaluation of crash avoidance systems. Transportation Research, 1621(1), 1–9.Reinders, R., van Eenennaam, M., Karagiannis, G., & Heijenk, G. (2004). Contention window analysis for beaconing in vanets. In Proceedings of the 2011 IEEE international conference on wireless communications and mobile computing (IWCMC), Istanbul (pp. 1481–1487).Yang, L., Guo, J., & Wu, Y. (2008). Channel adaptive one hop broadcasting for vanets. In Proceedings of the 2008 IEEE international conference on intelligent transportation systems, Beijing (pp. 369–374).Tseng, Y., Ni, S., Chen, Y., & Sheu, J. (2002). The broadcast storm problem in a mobile ad hoc network. Wireless Networks, 8(2), 153–167.van Eenennaam, E. M., Karagiannis, G., & Heijenk, G. (2010). Towards scalable beaconing in vanets. In Proceedings of the 2010 ERCIM workshop on eMobility, Lulea (pp. 103–108).Ros, F., Ruiz, P., & Stojmenovic, I. (2012). Acknowledgment-based broadcast protocol for reliable and efficient data dissemination in vehicular ad-hoc networks. IEEE Transactions on Mobile Computing, 11(1), 33–46.Torrent-Moreno, M., Santi, P., & Hartenstein, H. (2006). Distributed fair transmit power adjustment for vehicular ad hoc networks. In Proceedings of the 2007 IEEE international conference on sensor and ad hoc communications and networks, Reston, VA (pp. 479–488).Artimy, M. (2007). Local density estimation and dynamic transmission-range assignment in vehicular ad hoc networks. IEEE Transactions on Intelligent Transportation Systems, 8(3), 400–412.Caizzone, G., Giacomazzi, P., Musumeci, L., & Verticale, G. (2005). A power control algorithm with high channel availability for vehicular ad hoc networks. In Proceedings of the 2005 IEEE international conference on communications, Seoul (pp. 3171–3176).Torrent-Moreno, M., Santi, P., & Hartenstein, H. (2009). Vehicle-to-vehicle communication: Fair transmit power control for safety critical information. IEEE Transaction for Vehicular Technology, 58(7), 3684–3703.Torrent-Moreno, M., Schmidt-Eisenlohr, F., Fubler, H., & Hartenstein, H. (2006). Effects of a realistic channel model on packet forwarding in vehicular ad hoc networks. In Proceedings of the 2007 IEEE conference on wireless communications and networking, USA (pp. 385–391).NS, Network simulator (June 2011). http://nsnam.isi.edu/nsnam/index.php/MainPageNakagami, M. (1960). The m-distribution: A general formula of intensity distribution of rapid fadinge. In W. C. Hoffman (Ed.), Statistical method of radio propagation. New York: Pergamon Press.Narayanaswamy, S., Kawadia, V., Sreenivas, R., & Kumar, P. (2002). Power control in ad-hoc networks: Theory, architecture, algorithm and implementation of the compow protocol. In Proceedings of the 2002 European wireless conference next generation wireless networks: technologies, protocols, Italy (pp. 1–6).Cheng, P., Lee, K., Gerla, M., & Harri, J. (2010). Geodtn+ nav: Geographic dtn routing with navigator prediction for urban vehicular environments. Mobile Networks and Applications, 15(1), 61–82.Gomez, J., & Campbell, A. (2004). A case for variable-range transmission power control in wireless multihop networks. In Proceedings twenty-third annual joint conference of the IEEE computer and communications societies, Hong kong (pp. 1425–1436).Ramanathan, R., & Rosales-Hain, R. (2000). Topology control of multihop wireless networks using transmit power adjustment. In Proceedings nineteenth annual joint conference of the IEEE computer and communications societies, Hong kong (pp. 404–413).Artimy, M., Robertson, W., & Phillips, W. (2005). Assignment of dynamic transmission range based on estimation of vehicle density. In Proceedings of the 2nd ACM international workshop on vehicular ad hoc networks, Germany (pp. 40–48).Samara, G., Ramadas, S., & Al-Salihy, W. (2010). Safety message power transmission control for vehicular ad hoc networks. Computer Science, 6(10), 1027–1032.Rezaei, S., Sengupta, R., Krishnan, H., Guan, X., & Student, P. (2008). Adaptive communication scheme for cooperative active safety system.Rezaei, S., Sengupta, R., Krishnan, H., & Guan, X. (2007). Reducing the communication required by dsrc-based vehicle safety systems. In Proceedings of the 2007 IEEE international conference on intelligent transportation systems, Bellevue, WA (pp. 361–366).Sommer, C., Tonguz, O., & Dressler, F. (2011). Traffic information systems: Efficient message dissemination via adaptive beaconing. IEEE Communications Magazine, 49(5), 173–179.Thaina, C., Nakorn, K., & Rojviboonchai, K. (2011). A study of adaptive beacon transmission on vehicular ad-hoc networks. In Proceeding of the 2011 IEEE 13th international conference on communication technology (ICCT), Vancouver (pp. 597–602).Boukerche, A., Rezende, C., & Pazzi, R. (2009). Improving neighbor localization in vehicular ad hoc networks to avoid overhead from periodic messages. In Proceedings of the 2009 IEEE global telecommunications conference, USA (pp. 1–6).Bai, F., Sadagopan, N., & Helmy, A. (2008). Important: A framework to systematically analyze the impact of mobility on performance of routing protocols for adhoc networks. In Proceedings of the 2003 22th annual joint conference of the IEEE computer and communications, USA (pp. 825–835).Nguyen, H., Bhawiyuga, A., & Jeong, H. (2012). A comprehensive analysis of beacon dissemination in vehicular networks. In Proceedings of the 75th IEEE vehicular technology conference, Korea (pp. 1–5).Djahel, S., & Ghamri-Doudane, Y. (2012). A robust congestion control scheme for fast and reliable dissemination of safety messages in vanets. In Proceeding of the 2012 IEEE conference wireless communications and networking, Paris, France (pp. 2264–2269).O. Technologies (Augast 2012) Opnet modeler, http://www.opnet.com/Huang, C., Fallah, Y., Sengupta, R., & Krishnan, H. (2010). Adaptive intervehicle communication control for cooperative safety systems. IEEE Network, 24(1), 6–13.OPNET (June 2012) Opnet modeler, http://www.opnet.com/Kerner, B. (2004). The physics of traffic: Empirical freeway pattern features, engineering applications, and theory. Berlin: Springer.Vinel, A., Vishnevsky, V., & Koucheryavy, Y. (2008). A simple analytical model for the periodic broadcasting in vehicular ad-hoc networks. In Proceedings of the 2008 IEEE international GLOBECOM workshops, Philadelphia, PA (pp. 1–5).Mariyasagayam, N., Menouar, H., & Lenardi, M. (2009). An adaptive forwarding mechanism for data dissemination in vehicular networks. In Proceedings of the 2009 IEEE Vehicular Networking Conference, Boston (pp. 1–5).Hung, C., Chan, H., & Wu, E. (2008). Mobility pattern aware routing for heterogeneous vehicular networks. In Proceedings of the 2008 international conference on wireless communications and networking, Las Vegas (pp. 2200–2205).Yang, K., Ou, S., Chen, H., & He, J. (2007). A multihop peer-communication protocol with fairness guarantee for ieee 802.16-based vehicular networks. IEEE Transactions on Vehicular Technology, 56(6), 3358–3370.Lequerica, I., Ruiz, P., & Cabrera, V. (2010). Improvement of vehicular communications by using 3G capabilities to disseminate control information. IEEE Network Magazine, 24(1), 32–38.Oh, D., Kim, P., Song, J., Jeon, S., & Lee, H. (2005). Design considerations of satellite-based vehicular broadband networks. IEEE Wireless Communications Magazine, 12(5), 91–97.Ko, Y., Sim, M., & Nekovee, M. (2006). Wi-fi based broadband wireless access for users on the road. BT Technology Journal, 24(2), 123–129.Choffnes, D., & Bustamante, F. (2005). An integrated mobility and traffic model for vehicular wireless networks. In Proceedings of the 2005 ACM international workshop on vehicular ad hoc networks, Cologne (pp. 69–78).TIGER (October 2010) Topologically integrated geographic encoding and referencing system, http://www.census.gov/geo/www/tiger/Mittag, J., Thomas, F., Harri, J., & Hartenstein, H. (2009). A comparison of single and multi-hop beaconing in vanets. In Proceedings of the 2009 ACM international workshop on vehiculaar internetworking, Beijing (pp. 69–78).Rappaport, T. (1996). Wireless communications: Principles and practice (2nd ed.). New Jersey: Prentice Hall PTR

Design and evaluation of crash tolerant protocols for mobile ad-hoc networks

Mobile ad-hoc networks are wireless networks operating without any form of supporting infrastructure such as base-stations, and thus require the participating nodes to co-operate by forwarding each other's messages. Ad-hoc networks can be deployed when installing network infrastructure is considered too expensive, too cumbersome or simply too slow, for example in domains such as battlefields, search-and-rescue or space exploration. Tolerating node crashes and transient network partitions is likely to be important in such domains. However, developing applications which do so is a difficult task, a task which can be made easier by the availability of fault-tolerant protocols and middleware. This dissertation studies two core fault-tolerant primitives, reliable dissemination and consensus, and presents two families of protocols which implement these primitives in a wide range of mobile ad-hoc networks. The performance of the protocols is studied through simulation indicating that they are able to provide their guarantees in a bandwidth efficient manner. This is achieved by taking advantage of the broadcast nature and variable message delivery latencies inherent in ad-hoc networks. To illustrate the usefulness of these two primitives, a design for a distributed, fault-tolerant tuple space suitable to implement on mobile ad-hoc networks is presented. This design, if implemented, would provide a simple, yet powerful abstraction to the developer of fault-tolerant applications in mobile ad-hoc networks.EThOS - Electronic Theses Online ServiceGBUnited Kingdo

Toward Reliable Contention-aware Data Dissemination in Multi-hop Cognitive Radio Ad Hoc Networks

This paper introduces a new channel selection strategy for reliable contentionaware data dissemination in multi-hop cognitive radio network. The key challenge here is to select channels providing a good tradeoff between connectivity and contention. In other words, channels with good opportunities for communication due to (1) low primary radio nodes (PRs) activities, and (2) limited contention of cognitive ratio nodes (CRs) acceding that channel, have to be selected. Thus, by dynamically exploring residual resources on channels and by monitoring the number of CRs on a particular channel, SURF allows building a connected network with limited contention where reliable communication can take place. Through simulations, we study the performance of SURF when compared with three other related approaches. Simulation results confirm that our approach is effective in selecting the best channels for efficient and reliable multi-hop data dissemination

GCP: Gossip-based Code Propagation for Large-scale Mobile Wireless Sensor Networks

Wireless sensor networks (WSN) have recently received an increasing interest. They are now expected to be deployed for long periods of time, thus requiring software updates. Updating the software code automatically on a huge number of sensors is a tremendous task, as ''by hand'' updates can obviously not be considered, especially when all participating sensors are embedded on mobile entities. In this paper, we investigate an approach to automatically update software in mobile sensor-based application when no localization mechanism is available. We leverage the peer-to-peer cooperation paradigm to achieve a good trade-off between reliability and scalability of code propagation. More specifically, we present the design and evaluation of GCP ({\emph Gossip-based Code Propagation}), a distributed software update algorithm for mobile wireless sensor networks. GCP relies on two different mechanisms (piggy-backing and forwarding control) to improve significantly the load balance without sacrificing on the propagation speed. We compare GCP against traditional dissemination approaches. Simulation results based on both synthetic and realistic workloads show that GCP achieves a good convergence speed while balancing the load evenly between sensors