Self-Stabilizing Message Routing in Mobile ad hoc Networks

We present a self-stabilizing algorithm for routing messages between arbitrary pairs of nodes in a mobile ad hoc network. Our algorithm assumes the availability of a reliable GPS service, which supplies mobile nodes with accurate information about real time and about their own geographical locations. The GPS service provides an external, shared source of consistency for mobile nodes, allowing them to label and timestamp messages, and thereby aiding in recovery from failures. Our algorithm utilizes a Virtual Infrastructure programming abstraction layer, consisting of mobile client nodes, virtual stationary timed machines called Virtual Stationary Automata (VSAs), and a local broadcast service connecting VSAs and mobile clients. VSAs are associated with predetermined regions in the plane, and are emulated in a self-stabilizing manner by the mobile nodes. VSAs are relatively stable in the face of node mobility and failure, and can be used to simplify algorithm development for mobile networks. Our routing algorithm consists of three subalgorithms: [(1)] a VSA-to-VSA geographical routing algorithm, [2] a mobile client location management algorithm, and [3] the main algorithm, which utilizes both location management and geographical routing. All three subalgorithms are self-stabilizing, and consequently, the entire algorithm is also self-stabilizing

Adaptive Cross-Layer Multipath Routing Protocol for Mobile Ad Hoc Networks

[EN] Mobile ad hoc networks (MANETs) are generally created for temporary scenarios. In such scenarios, where nodes are in mobility, efficient routing is a challenging task. In this paper, we propose an adaptive and cross-layer multipath routing protocol for such changing scenarios. Our routing mechanisms operate keeping in view the type of applications. For simple applications, the proposed protocol is inspired from traditional on-demand routing protocols by searching shortest routes from source to destination using default parameters. In case of multimedia applications, the proposed mechanism considers such routes which are capable of providing more data rates having less packet loss ratio. For those applications which need security, the proposed mechanism searches such routes which are more secure in nature as compared to others. Cross-layer methodology is used in proposed routing scheme so as to exchange different parameters across the protocol stack for better decision-making at network layer. Our approach is efficient and fault tolerant in a variety of scenarios that we simulated and tested.The authors would like to extend their sincere appreciation to the Deanship of Scientific Research at King Saud University for funding this research group no. 037-1435-RG.Iqbal, Z.; Khan, S.; Mehmood, A.; Lloret, J.; Alrajeh, NA. (2016). Adaptive Cross-Layer Multipath Routing Protocol for Mobile Ad Hoc Networks. Journal of Sensors. 2016:1-18. https://doi.org/10.1155/2016/5486437S1182016Abusalah, L., Khokhar, A., & Guizani, M. (2008). A survey of secure mobile Ad Hoc routing protocols. IEEE Communications Surveys & Tutorials, 10(4), 78-93. doi:10.1109/surv.2008.080407Murthy, S., & Garcia-Luna-Aceves, J. J. (1996). An efficient routing protocol for wireless networks. Mobile Networks and Applications, 1(2), 183-197. doi:10.1007/bf01193336Toh, C.-K. (1997). Wireless Personal Communications, 4(2), 103-139. doi:10.1023/a:1008812928561Pearlman, M. R., & Haas, Z. J. (1999). Determining the optimal configuration for the zone routing protocol. IEEE Journal on Selected Areas in Communications, 17(8), 1395-1414. doi:10.1109/49.779922ZHEN, Y., WU, M., WU, D., ZHANG, Q., & XU, C. (2010). Toward path reliability by using adaptive multi-path routing mechanism for multimedia service in mobile Ad-hoc network. The Journal of China Universities of Posts and Telecommunications, 17(1), 93-100. doi:10.1016/s1005-8885(09)60431-3Sivakumar, R., Sinha, P., & Bharghavan, V. (1999). CEDAR: a core-extraction distributed ad hoc routing algorithm. IEEE Journal on Selected Areas in Communications, 17(8), 1454-1465. doi:10.1109/49.779926Zapata, M. G. (2002). Secure ad hoc on-demand distance vector routing. ACM SIGMOBILE Mobile Computing and Communications Review, 6(3), 106-107. doi:10.1145/581291.581312Khan, S., & Loo, J. (2010). Cross Layer Secure and Resource-Aware On-Demand Routing Protocol for Hybrid Wireless Mesh Networks. Wireless Personal Communications, 62(1), 201-214. doi:10.1007/s11277-010-0048-ySharma, V., & Alam, B. (2012). Unicaste Routing Protocols in Mobile Ad Hoc Networks: A Survey. International Journal of Computer Applications, 51(14), 9-18. doi:10.5120/8108-1714Tarique, M., Tepe, K. E., Adibi, S., & Erfani, S. (2009). Survey of multipath routing protocols for mobile ad hoc networks. Journal of Network and Computer Applications, 32(6), 1125-1143. doi:10.1016/j.jnca.2009.07.002Shiwen Mao, Shunan Lin, Yao Wang, Panwar, S. S., & Yihan Li. (2005). Multipath video transport over ad hoc networks. IEEE Wireless Communications, 12(4), 42-49. doi:10.1109/mwc.2005.1497857Li, Z., Chen, Q., Zhu, G., Choi, Y., & Sekiya, H. (2015). A Low Latency, Energy Efficient MAC Protocol for Wireless Sensor Networks. International Journal of Distributed Sensor Networks, 11(8), 946587. doi:10.1155/2015/946587Zheng, Z., Liu, A., Cai, L. X., Chen, Z., & Shen, X. (2016). Energy and memory efficient clone detection in wireless sensor networks. IEEE Transactions on Mobile Computing, 15(5), 1130-1143. doi:10.1109/tmc.2015.2449847Dong, M., Ota, K., Liu, A., & Guo, M. (2016). Joint Optimization of Lifetime and Transport Delay under Reliability Constraint Wireless Sensor Networks. IEEE Transactions on Parallel and Distributed Systems, 27(1), 225-236. doi:10.1109/tpds.2015.2388482Hamrioui, S., Lorenz, P., Lloret, J., & Lalam, M. (2013). A Cross Layer Solution for Better Interactions Between Routing and Transport Protocols in MANET. Journal of Computing and Information Technology, 21(3), 137. doi:10.2498/cit.1002136Sanchez-Iborra, R., & Cano, M.-D. (2014). An approach to a cross layer-based QoE improvement for MANET routing protocols. Network Protocols and Algorithms, 6(3), 18. doi:10.5296/npa.v6i3.5827Cho, J.-H., Swami, A., & Chen, I.-R. (2011). A Survey on Trust Management for Mobile Ad Hoc Networks. IEEE Communications Surveys & Tutorials, 13(4), 562-583. doi:10.1109/surv.2011.092110.0008

Energy-aware self stabilization in mobile ad hoc networks : A multicasting case study

Dynamic networks, e.g. Mobile Ad Hoc Networks (MANETs), call for adaptive protocols that can tolerate topological changes due to nodes ’ mobility and depletion of battery power. Also proactivity in these protocols is essential to ensure low latency. Self-stabilization techniques for distributed systems provide both adaptivity and proactivity to make it suitable for the MANETs. However, energyefficiency- a prime concern in MANETs with batterypowered nodes- is not guaranteed by self-stabilization. In this paper, we propose a node-based energy metric that minimizes the energy consumption of the multicast tree by taking into account the overhearing cost. We apply the metric to Self-Stabilizing Shortest Path Spanning Tree (SS-SPST) protocol to obtain energy-aware SS-SPST (SS-SPST-E). Using simulations, we study the energy-latency tradeoff by comparing SS-SPST-E with SS-SPST and other MANET multicast protocols, such as ODMRP and MAODV.

A scalable mutual exclusion algorithm for mobile ad hoc networks

2005-2006 > Academic research: refereed > Refereed conference paperVersion of RecordPublishe

A leader election algorithm for dynamic networks with causal clocks

An algorithm for electing a leader in an asynchronous network with dynamically changing communication topology is presented. The algorithm ensures that, no matter what pattern of topology changes occurs, if topology changes cease, then eventually every connected component contains a unique leader. The algorithm combines ideas from the Temporally Ordered Routing Algorithm for mobile ad hoc networks (Park and Corson in Proceedings of the 16th IEEE Conference on Computer Communications (INFOCOM), pp. 1405–1413 (1997) with a wave algorithm (Tel in Introduction to distributed algorithms, 2nd edn. Cambridge University Press, Cambridge, MA, 2000), all within the framework of a height-based mechanism for reversing the logical direction of communication topology links (Gafni and Bertsekas in IEEE Trans Commun C–29(1), 11–18 1981). Moreover, a generic representation of time is used, which can be implemented using totally-ordered values that preserve the causality of events, such as logical clocks and perfect clocks. A correctness proof for the algorithm is provided, and it is ensured that in certain well-behaved situations, a new leader is not elected unnecessarily, that is, the algorithm satisfies a stability condition.National Science Foundation (U.S.) (0500265)Texas Higher Education Coordinating Board (ARP-00512-0007-2006)Texas Higher Education Coordinating Board (ARP 000512-0130-2007)National Science Foundation (U.S.) (IIS-0712911)National Science Foundation (U.S.) (CNS-0540631)National Science Foundation (U.S.) (Research Experience for Undergraduates (Program) (0649233)

Communication Algorithms for Wireless Ad Hoc Networks

In this dissertation we present deterministic algorithms for reliable and efficient communication in ad hoc networks. In the first part of this dissertation we give a specification for a reliable neighbor discovery layer for mobile ad hoc networks. We present two different algorithms that implement this layer with varying progress guarantees. In the second part of this dissertation we give an algorithm which allows nodes in a mobile wireless ad hoc network to communicate reliably and at the same time maintain local neighborhood information. In the last part of this dissertation we look at the distributed trigger counting problem in the wireless ad hoc network setting. We present a deterministic algorithm for this problem which is communication efficient in terms of the the maximum number of messages received by any processor in the system

Optimal pricing in a free market wireless network

We consider an ad-hoc wireless network operating within a free market economic model. Users send data over a choice of paths, and scheduling and routing decisions are updated dynamically based on time varying channel conditions, user mobility, and current network prices charged by intermediate nodes. Each node sets its own price for relaying services, with the goal of earning revenue that exceeds its time average reception and transmission expenses. We first develop a greedy pricing strategy that maximizes social welfare while ensuring all participants make non-negative profit. We then construct a (non-greedy) policy that balances profits more evenly by optimizing a profit fairness metric. Both algorithms operate in a distributed manner and do not require knowledge of traffic rates or channel statistics. This work demonstrates that individuals can benefit from carrying wireless devices even if they are not interested in their own personal communication

Self-stabilizing cache placements in Manets

In ad-hoc networks mobile nodes communicate with each other using other nodes in the network as routers. Each node acts as a router, forwarding data packets for other nodes. There are many dynamic routing protocols to find routes between the communicating nodes. The bandwidth and power are limited in MANETs. Although routing is important in MANETs, the final task of MANETs is Data accessing. So, there is need to implement new techniques apart from routing for data access to save bandwidth and power. If some of the nodes in MANET is provided some of the services from internet Service Provider, then the other nodes also want to access these services. Then, there is a need for caching these services to reduce bandwidth and power; Caching the internet based services in MANETs is an important technique to reduce bandwidth, energy consumption and latency. If some of the nodes store the object data and code and acts as a cache proxies, then nodes near the cache proxies can get the requested data from the cache proxy rather than from a far away server node saving bandwidth and access latency; In this thesis research, we design a distributed self-stabilizing algorithm to place the caches in MANETs. If a node requests the service, it will search for the service and if that service is located in a node that is at a distance greater than D, then the requested node caches the data. In our algorithm, nodes that cache the same data will be at a distance greater than D. We also describe an algorithm to have the shortest path from the source of the data object to all the nodes that cache the same data in the network. This path is used to update the DATA that is cached in the nodes. We propose the algorithm for a single service or DATA. We can implement this algorithm in parallel for all the services available in the MANET; A self-stabilizing system has the ability to automatically recover to normal behavior in case of transient faults without a centralized control. The proposed algorithm does not require any initialization, that is, starting from an arbitrary state, it is guaranteed to satisfy its specification in finite steps. The protocol can handle various types of faults

A Radio Link Quality Model and Simulation Framework for Improving the Design of Embedded Wireless Systems

Despite the increasing application of embedded wireless systems, developers face numerous challenges during the design phase of the application life cycle. One of the critical challenges is ensuring performance reliability with respect to radio link quality. Specifically, embedded links experience exaggerated link quality variation, which results in undesirable wireless performance characteristics. Unfortunately, the resulting post-deployment behaviors often necessitate network redeployment. Another challenge is recovering from faults that commonly occur in embedded wireless systems, including node failure and state corruption. Self-stabilizing algorithms can provide recovery in the presence of such faults. These algorithms guarantee the eventual satisfaction of a given state legitimacy predicate regardless of the initial state of the network. Their practical behavior is often different from theoretical analyses. Unfortunately, there is little tool support for facilitating the experimental analysis of self-stabilizing systems. We present two contributions to support the design phase of embedded wireless system development. First, we provide two empirical models that predict radio-link quality within specific deployment environments. These models predict link performance as a function of inter-node distance and radio power level. The models are culled from extensive experimentation in open grass field and dense forest environments using all radio power levels and covering up to the maximum distances reachable by the radio. Second, we provide a simulation framework for simulating self-stabilizing algorithms. The framework provides three feature extensions: (i) fault injection to study algorithm behavior under various fault scenarios, (ii) automated detection of non-stabilizing behavior; and (iii) integration of the link quality models described above. Our contributions aim at avoiding problems that could result in the need for network redeployment

Survey on Data-Centric based Routing Protocols for Wireless Sensor Networks

The great concern for energy that grew with the technological advances in the field of networks and especially in sensor network has triggered various approaches and protocols that relate to sensor networks. In this context, the routing protocols were of great interest. The aim of the present paper is to discuss routing protocols for sensor networks. This paper will focus mainly on the discussion of the data-centric approach (COUGAR, rumor, SPIN, flooding and Gossiping), while shedding light on the other approaches occasionally. The functions of the nodes will be discussed as well. The methodology selected for this paper is based on a close description and discussion of the protocol. As a conclusion, open research questions and limitations are proposed to the reader at the end of this paper