Implementation of Congestion Awareness and Adaptivity in Mobile Ad Hoc Networks

Congestion in mobile ad hoc networks leads to transmission delays and packet losses and causes wastage of time and energy on recovery. In the current designs, routing is not congestion adaptive. Routing may let a congestion happen which is detected by congestion control, but dealing with congestion in this reactive manner results in longer delay and unnecessary packet loss and requires significant overhead if a new route is needed. This problem becomes more visible especially in large-scale transmission of heavy traffic such as multimedia data, where congestion is more probable and the negative impact of packet loss on the service quality is of more significance. Routing should not only be aware of, but also be adaptive to, network congestion. Routing protocols which are adaptive to the congestion status of a mobile ad hoc network can greatly improve the network performance. Many protocols which are congestion aware and congestion adaptive have been proposed. In this paper, we present a survey of congestion adaptive routing protocols for mobile ad hoc networks. Ad hoc networks consist of independent self-structured nodes. Nodes utilize a wireless medium for exchange their message or data, as a result two nodes can converse in a straight one to one connection if and only if they are within every other?s transmit range

A Study of Congestion Aware Adaptive Routing Protocols in MANET

Routing protocols for mobile ad hoc networks (MANETs) have been explored extensively in last few years. Much of this work is targeted at finding a feasible route from a source to a destination without considering current network traffic or application requirements. Routing may let a congestion happen which is detected by congestion control, but dealing with congestion in reactive manner results in longer delay, and unnecessary packet loss and requires significant overhead if a new route is needed. Routing should not be aware of, but also be adaptive to, network congestion. Adaptation to the congestion helps to increase both the effectiveness and efficiency of routing. These problems are solved by the congestion-aware routing protocols in certain degree. These protocols which are adaptive to congestion status of mobile ad-hoc network can greatly improve the network performance. In this paper, we present the survey of congestion adaptive routing protocols for mobile ad-hoc network. Finally, the future direction of congestion-aware routing protocols is described. Keywords: Ad hoc networks, congestion aware routing, Congestion metric, congestion adaptabilit

Wireless Communication Protocols for Distributed Computing Environments

The distributed computing is an approach relying on the presence of multiple devices that can interact among them in order to perform a pervasive and parallel computing. This chapter deals with the communication protocol aiming to be used in a distributed computing scenario; in particular the considered computing infrastructure is composed by elements (nodes) able to consider specific application requests for the implementation of a service in a distributed manner according to the pervasive grid computing principle (Priol & Vanneschi, 2008; Vanneschi & Veraldi, 2007). In the classical grid computing paradigm, the processing nodes are high performance computers or multicore workstations, usually organized in clusters and interconnected through broadband wired communication networks with small delay (e.g., fiber optic, DSL lines). The pervasive grid computing paradigm overcomes these limitations allowing the development of distributed applications that can perform parallel computations using heterogeneous devices interconnected by different types of communication technologies. In this way, we can resort to a computing environment composed by fixed ormobile devices (e.g., smartphones, PDAs, laptops) interconnected through broadband wireless or wired networks where the devices are able to take part to a grid computing process. Suitable techniques for the pervasive grid computing should be able to discover and organize heterogeneous resources, to allow scaling an application according to the computing power, and to guarantee specific QoS profiles (Darby III & Tzeng, 2010; Roy & Das, 2009). In particular, aim of this chapter is to present the most important challenges for the communication point of view when forming a distributed network for performing parallel and distributed computing. The focus will be mainly on the resource discovery and computation scheduling on wireless not infrastructured networks by considering their capabilities in terms of reliability and adaptation when facing with heterogeneous computing requests

Regulating Highly Automated Robot Ecologies: Insights from Three User Studies

Highly automated robot ecologies (HARE), or societies of independent autonomous robots or agents, are rapidly becoming an important part of much of the world's critical infrastructure. As with human societies, regulation, wherein a governing body designs rules and processes for the society, plays an important role in ensuring that HARE meet societal objectives. However, to date, a careful study of interactions between a regulator and HARE is lacking. In this paper, we report on three user studies which give insights into how to design systems that allow people, acting as the regulatory authority, to effectively interact with HARE. As in the study of political systems in which governments regulate human societies, our studies analyze how interactions between HARE and regulators are impacted by regulatory power and individual (robot or agent) autonomy. Our results show that regulator power, decision support, and adaptive autonomy can each diminish the social welfare of HARE, and hint at how these seemingly desirable mechanisms can be designed so that they become part of successful HARE.Comment: 10 pages, 7 figures, to appear in the 5th International Conference on Human Agent Interaction (HAI-2017), Bielefeld, German

Novel Interference And Spectrum Aware Routing Techniques}{for Cognitive Radio Ad Hoc Networks

Tez (Doktora) -- İstanbul Teknik Üniversitesi, Fen Bilimleri Enstitüsü, 2011Thesis (PhD) -- İstanbul Technical University, Institute of Science and Technology, 2011Yüksek hızlı kablosuz ağlara artan rağbet nedeniyle, radyo spektrumu dünya üzerinde en çok kullanılan ve pahalı doğal kaynaklardan biri haline gelmiştir. Lisanslı spektrumu etkin şekilde kullanma ve paylaşmaya olanak sağlaması nedeniyle radyo spektrumundan yararlanma potansiyelini arttıran bilişsel radyo teknolojisi büyük ilgi toplamaktadır. Söz konusu potansiyelden faydalanmak üzere bilişsel radyo ağları tasarlanırken üzerinde önemle durulması gereken en önemli konulardan bir tanesi de yönlendirmedir. Çalışmamızda bilişsel radyo ağlarında kullanılmak üzere önerilen yönlendirme teknikleri hakkında bir bakış açısı sunulmakla beraber asıl olarak girişim ve spektruma dayalı özgün yönlendirme teknikleri önerilmektedir. Öncelikle, spektrum kullanım karakteristikleri ve ağdaki akışların yarattığı girişim göz önüne alınarak yönlendirme ölçütleri tasarlanmıştır. Ayrıca, bilişsel radyo ağları için otonom dağıtık uyarlanır menzil kontrol stratejisi önerilmiştir. Bu önerilere ek olarak dağıtık ve etkin bir kümeleme tabanlı yönlendirme tekniği geliştirilmiştir. Son olarak, bilişsel radyo ağları için otonom dağıtık uyarlanır menzil kontrol stratejisi ve spektrum erişebilirliği ve girişim maliyeti ölçütlerini bir arada kullanan özgün bir yönlendirme tekniği önerilmiştir. Önerilen yeni yönlendirme ölçütlerinin kullanımı nedeniyle önerilen teknik trafiği kullanılabilir spektrumun daha çok ve girişimin daha az olduğu rotalara yönlendirmektedir. NS2 benzetim ortamı kullanılarak gerçekleştirilen testler, önerilen yöntemlerin bilişsel radyo ağlarına uygunluğunu ve ağ başarımını arttırdığını göstermiştir. Ayrıca güncel bilişsel radyo teknolojisini kullanan diğer yöntemlerle karşılaştırıldığında önerilen tekniklerin hem uçtan uca veri aktarımını arttırdığı hem de uçtan uca gecikmeyi azalttığı ve başarımlarının daha yüksek olduğu gözlemlenmiştir.Radio spectrum has become one of the most heavily used and expensive natural resource around the world because of the growing demand for high-speed wireless networks. Cognitive radio has received great attention due to tremendous potential to improve the utilization of the radio spectrum by efficiently reusing and sharing the licensed spectrum. To design such mobile cognitive radio networks, routing is one of the key challenging issues to be addressed and requires deep investigation. This study gives some insights about the potential routing approaches that can be employed, and suggests novel interference and spectrum aware routing techniques for cognitive radio networks. First, the spectrum usage characteristics, and the interference created by existing flows in the network both from the primary and secondary users are taken into account to define routing metrics. Next, an autonomous distributed adaptive transmission range control scheme for cognitive radio networks is proposed. A distributed and efficient cluster based routing technique, which benefits from new metrics, is also introduced. The last proposed routing algorithm incorporates novel metrics and autonomous distributed adaptive transmission range control mechanism to provide self adaptivity. As a consequence, the proposed protocol routes traffic across paths with better spectrum availability and reduced interference via these new routing metrics. Extensive experimental evaluations are performed in the ns2 simulator to show that proposed protocols provide better adaptability to the environment and maximize throughput, minimize end-to-end delay in a number of realistic scenarios and outperforms recently proposed routing protocols developed for cognitive radio networks.DoktoraPh

A cross-layer implementation of Ad hoc On-demand Distance Vector routing (AODV) protocol

Mobile Ad hoc Networks (MANETs) are networks which will form the basis for the ubiquitous data access because of their ease of deployment. Due to the dynamic nature of a MANET, routing is one of the most critical elements of MANET. Routing protocols for MANET can be broadly classified as a proactive routing protocol or a reactive routing protocol. In the proactive routing protocols, mobile nodes periodically exchange routing information among themselves. Hence proactive routing protocols generate high overhead messages in the network. On the other hand, reactive routing protocols work on-demand. Thereby generating less number of overhead messages in the network compared to proactive routing protocols. But reactive routing protocols use a global search mechanism called \u27flooding\u27 during the route discovery process. \u27Flooding\u27 generates a huge number of overhead messages in the network. Those overhead messages affect the performance of reactive routing protocols in term of network throughput. That kind of performance problem is called \u27scaling\u27 problem. Ad hoc On-demand Distance Vector Routing with Cross-Layer Design (AODV-CL) protocol has been proposed to solve this scaling problem. The AODV routing protocol has been modified to implement AODV-CL protocol. AODV-CL protocol reduces \u27flooding\u27 problem of reactive routing protocols by limiting the number of nodes that should participate in route discovery process based on their status in the network and also avoiding congested area of the network. It is shown that AODV-CL protocol reduces overhead messages by 73% and reduces end-to-end delay per packet by 32% compared to regular AODV protocol. I

GSAR: Greedy Stand-Alone Position-Based Routing protocol to avoid hole problem occurance in Mobile Ad Hoc Networks

The routing process in a Mobile Ad Hoc Network (MANET) poses critical challenges because of its features such as frequent topology changes and resource limitations. Hence, designing a reliable and dynamic routing protocol that satisfies MANET requirements is highly demanded. The Greedy Forwarding Strategy (GFS) has been the most used strategy in position-based routing protocols. The GFS algorithm was designed as a high-performance protocol that adopts hop count in soliciting shortest path. However, the GFS does not consider MANET needs and is therefore insufficient in computing reliable routes. Hence, this study aims to improve the existing GFS by transforming it into a dynamic stand-alone routing protocol that responds swiftly to MANET needs, and provides reliable routes among the communicating nodes. To achieve the aim, two mechanisms were proposed as extensions to the current GFS, namely the Dynamic Beaconing Updates Mechanism (DBUM) and the Dynamic and Reactive Reliability Estimation with Selective Metrics Mechanism (DRESM). The DBUM algorithm is mainly responsible for providing a node with up-to-date status information about its neighbours. The DRESM algorithm is responsible for making forwarding decisions based on multiple routing metrics. Both mechanisms were integrated into the conventional GFS to form Greedy Stand-Alone Routing (GSAR) protocol. Evaluations of GSAR were performed using network simulator Ns2 based upon a defined set of performance metrics, scenarios and topologies. The results demonstrate that GSAR eliminates recovery mode mechanism in GFS and consequently improve overall network performance. Under various mobility conditions, GSAR avoids hole problem by about 87% and 79% over Greedy Perimeter Stateless Routing and Position-based Opportunistic Routing Protocol respectively. Therefore, the GSAR protocol is a reasonable alternative to position-based unicast routing protocol in MANET