An analysis of the lifetime of OLSR networks

The Optimized Link State Routing (OLSR) protocol is a well-known route discovery protocol for ad-hoc networks. OLSR optimizes the flooding of link state information through the network using multipoint relays (MPRs). Only nodes selected as MPRs are responsible for forwarding control traffic. Many research papers aim to optimize the selection of MPRs with a specific purpose in mind: e.g., to minimize their number, to keep paths with high Quality of Service or to maximize the network lifetime (the time until the first node runs out of energy). In such analyzes often the effects of the network structure on the MPR selection are not taken into account. In this paper we show that the structure of the network can have a large impact on the MPR selection. In highly regular structures (such as grids) there is even no variation in the MPR sets that result from various MPR selection mechanisms. Furthermore, we study the influence of the network structure on the network lifetime problem in a setting where at regular intervals messages are broadcasted using MPRs. We introduce the ’maximum forcedness ratio’, as a key parameter of the network to describe how much variation there is in the lifetime results of various MPR selection heuristics. Although we focus our attention to OLSR, being a widely implemented protocol, on a more abstract level our results describe the structure of connected sets dominating the 2-hop neighborhood of a node

Energy-Aware Topology Control Strategy for Human-Centric Wireless Sensor Networks

The adoption of mobile and ubiquitous solutions that involve participatory or opportunistic sensing increases every day. This situation has highlighted the relevance of optimizing the energy consumption of these solutions, because their operation depends on the devices’ battery lifetimes. This article presents a study that intends to understand how the prediction of topology control messages in human-centric wireless sensor networks can be used to help reduce the energy consumption of the participating devices. In order to do that, five research questions have been defined and a study based on simulations was conducted to answer these questions. The obtained results help identify suitable mobile computing scenarios where the prediction of topology control messages can be used to save energy of the network nodes. These results also allow estimating the percentage of energy saving that can be expected, according to the features of the work scenario and the participants behavior. Designers of mobile collaborative applications that involve participatory or opportunistic sensing, can take advantage of these findings to increase the autonomy of their solutions.Fil: Meseguer, Roc . Universidad Politecnica de Catalunya; EspañaFil: Molina, Carlos. Universitat Rovira I Virgili; EspañaFil: Ochoa, Sergio F.. Universidad de Chile; ChileFil: Santos, Rodrigo Martin. Universidad Nacional del Sur. Departamento de Ingenieria Electrica y de Computadoras. Laboratorio de Sistemas Digitales; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Bahía Blanca. Instituto de Investigación en Ingeniería Eléctrica; Argentin

Adoption of vehicular ad hoc networking protocols by networked robots

This paper focuses on the utilization of wireless networking in the robotics domain. Many researchers have already equipped their robots with wireless communication capabilities, stimulated by the observation that multi-robot systems tend to have several advantages over their single-robot counterparts. Typically, this integration of wireless communication is tackled in a quite pragmatic manner, only a few authors presented novel Robotic Ad Hoc Network (RANET) protocols that were designed specifically with robotic use cases in mind. This is in sharp contrast with the domain of vehicular ad hoc networks (VANET). This observation is the starting point of this paper. If the results of previous efforts focusing on VANET protocols could be reused in the RANET domain, this could lead to rapid progress in the field of networked robots. To investigate this possibility, this paper provides a thorough overview of the related work in the domain of robotic and vehicular ad hoc networks. Based on this information, an exhaustive list of requirements is defined for both types. It is concluded that the most significant difference lies in the fact that VANET protocols are oriented towards low throughput messaging, while RANET protocols have to support high throughput media streaming as well. Although not always with equal importance, all other defined requirements are valid for both protocols. This leads to the conclusion that cross-fertilization between them is an appealing approach for future RANET research. To support such developments, this paper concludes with the definition of an appropriate working plan

Energy Consumption Balancing in OLSR Ad Hoc Wireless Routing Protocol

The Mobile computer science requires many processing. Besides the communication activities, the energy consumption is one of the most critical issues as far as the batteries mobile devices are concerned. Especially, in ad hoc networks where each node is responsible to transmit data packets for the neighbour nodes. Thus, a particular wariness must be taken not only to minimize all nodes appropriate energy consumption but also to balance the batteries individual levels. Any unbalanced energy usage can, however, cause a failure on one of the overloaded nodes and thus lead to partitioning and decreasing the network lifetime. In the present paper, we first introduce the state of art the ad hoc networks and then its energy consumption, followed by a detailled description of the standard Optimized Link State Routing (OLSR) protocol. Second, we insert the energy consumption criterion QoS. With such an objective, we bring an the improvement at the heuristics of the nodes selection at multipoint relays (MPR), which represents the strongest point of the OLSR routing. Finally, we suggest three algorithms for the MPR selection process according to the energy constraints

An altruistic cross-layer recovering mechanism for ad hoc wireless networks

Video streaming services have restrictive delay and bandwidth constraints. Ad hoc networks represent a hostile environment for this kind of real-time data transmission. Emerging mesh networks, where a backbone provides more topological stability, do not even assure a high quality of experience. In such scenario, mobility of terminal nodes causes link breakages until a new route is calculated. In the meanwhile, lost packets cause annoying video interruptions to the receiver. This paper proposes a new mechanism of recovering lost packets by means of caching overheard packets in neighbor nodes and retransmit them to destination. Moreover, an optimization is shown, which involves a video-aware cache in order to recover full frames and prioritize more significant frames. Results show the improvement in reception, increasing the throughput as well as video quality, whereas larger video interruptions are considerably reduced. Copyright © 2014 John Wiley & Sons, Ltd.Arce Vila, P.; Guerri Cebollada, JC. (2015). An altruistic cross-layer recovering mechanism for ad hoc wireless networks. Wireless Communications and Mobile Computing. 15(13):1744-1758. doi:10.1002/wcm.2459S174417581513Li J Blake C De Couto DSJ Lee HI Morris R Capacity of ad hoc wireless networks Proceedings of the 7th Annual International Conference on Mobile Computing and Networks (MobiCom) 2001 61 69Akyildiz, I. F., & Xudong Wang. (2005). A survey on wireless mesh networks. IEEE Communications Magazine, 43(9), S23-S30. doi:10.1109/mcom.2005.1509968Hsu, C.-J., Liu, H.-I., & Seah, W. K. G. (2011). Opportunistic routing – A review and the challenges ahead. Computer Networks, 55(15), 3592-3603. doi:10.1016/j.comnet.2011.06.021Huang, X., Zhai, H., & Fang, Y. (2008). Robust cooperative routing protocol in mobile wireless sensor networks. IEEE Transactions on Wireless Communications, 7(12), 5278-5285. doi:10.1109/t-wc.2008.060680Wieselthier, J. E., Nguyen, G. D., & Ephremides, A. (2001). Mobile Networks and Applications, 6(3), 251-263. doi:10.1023/a:1011478717164Clausen T Jacquet P Optimized Link State Routing Protocol (OLSR), IETF RFC 3626 2003 http://www.rfc-editor.org/rfc/rfc3626.txtMarina, M. K., & Das, S. R. (2006). Ad hoc on-demand multipath distance vector routing. Wireless Communications and Mobile Computing, 6(7), 969-988. doi:10.1002/wcm.432Zhou X Lu Y Ma HG Routing improvement using multiple disjoint paths for ad hoc networks International Conference on Wireless and Optical Communications Networks (IFIP) 2006 1 5Fujisawa H Minami H Yamamoto M Izumi Y Fujita Y Route selection using retransmission packets for video streaming on ad hoc networks IEEE Conference on Radio and Wireless Symposium (RWS) 2006 607 610Badis H Agha KA QOLSR multi-path routing for mobile ad hoc networks based on multiple metrics: bandwidth and delay IEEE 59th Vehicular Technology Conference (VTC) 2004 2181 2184Wu Z Wu J Cross-layer routing optimization for video transmission over wireless ad hoc networks 6th International Conference on Wireless Communications Networks and Mobile Computing (WiCOM) 2010 1 6Schier, M., & Welzl, M. (2012). Optimizing Selective ARQ for H.264 Live Streaming: A Novel Method for Predicting Loss-Impact in Real Time. IEEE Transactions on Multimedia, 14(2), 415-430. doi:10.1109/tmm.2011.2178235Nikoupour M Nikoupour A Dehghan M A cross-layer framework for video streaming over wireless ad-hoc networks 3rd International Conference on Digital Information Management (ICDIM) 2008 340 345Yamamoto R Miyoshi T Distributed retransmission method using neighbor terminals for ad hoc networks Proceedings of the 14th Asia-Pacific Conference on Communications (APCC) 2008 1 5Gravalos I Kokkinos P Varvarigos EA Multi-criteria cooperative energy-aware routing in wireless ad-hoc networks Proceedings of the 9th International Wireless Communications and Mobile Computing Conference (IWCMC) 2013 387 393Abid, R. M., Benbrahim, T., & Biaz, S. (2010). IEEE 802.11s Wireless Mesh Networks for Last-Mile Internet Access: An Open-Source Real-World Indoor Testbed Implementation. Wireless Sensor Network, 02(10), 725-738. doi:10.4236/wsn.2010.210088Yen, Y.-S., Chang, R.-S., & Wu, C.-Y. (2011). A seamless handoff scheme for IEEE 802.11 wireless networks. Wireless Communications and Mobile Computing, 13(2), 157-169. doi:10.1002/wcm.1102Liangzhong Yin, & Guohong Cao. (2006). Supporting cooperative caching in ad hoc networks. IEEE Transactions on Mobile Computing, 5(1), 77-89. doi:10.1109/tmc.2006.15Biswas S Morris R ExOR: opportunistic multi-hop routing for wireless networks Proceedings of ACM SIGCOMM 2005 133 144Chachulski S Jennings M Katti S Katabi D Trading structure for randomness in wireless opportunistic routing Proceedings of ACM SIGCOMM 2007 169 180Kohler E Handley M Floyd S Datagram Congestion Control Protocol (DCCP), IETF RFC 4340 2006 http://www.rfc-editor.org/rfc/rfc4340.txtSchierl, T., Ganger, K., Hellge, C., Wiegand, T., & Stockhammer, T. (2006). SVC-based multisource streaming for robust video transmission in mobile ad hoc networks. IEEE Wireless Communications, 13(5), 96-103. doi:10.1109/wc-m.2006.250365Iera, A., Molinaro, A., Paratore, S. Y., Ruggeri, G., & Zurzolo, A. (2011). Making a mesh router/gateway from a smartphone: Is that a practical solution? Ad Hoc Networks, 9(8), 1414-1429. doi:10.1016/j.adhoc.2011.03.00

OLSRp: predicting control information to achieve scalability in OLSR ad hoc networks

Scalability is a key design challenge that routing protocols for ad hoc networks must properly address to maintain the network performance when the number of nodes increases. We focus on this issue by reducing the amount of control information messages that a link state proactive routing algorithm introduces to the network. Our proposal is based on the observation that a high percentage of those messages is always the same. Therefore, we introduce a new mechanism that can predict the control messages that nodes need for building an accurate map of the network topology so they can avoid resending the same messages. This prediction mechanism, applied to OLSR protocol, could be used to reduce the number of messages transmitted through the network and to save computational processing and energy consumption. Our proposal is independent of the OLSR configuration parameters and it can dynamically self-adapt to network changes.Postprint (published version