Convergence Aspects of Autonomic Cooperative Networks

Author(s):  
Michal Wódczak

The current efforts across industry and academia are to develop new paradigms that enable ubiquitous on-demand service provision. This aim may be achievable because of the envisaged deployment of cutting-edge technologies such as cooperative transmission. However, a real advancement is only attainable when autonomic system design principles are taken into account. Looking at the concept of the Relay Enhanced Cell, one may come across commonalities with Mobile Ad-hoc Networks. Especially in Local Area scenarios, Base Stations seem to resemble advanced Access Points, while fixed and movable Relay Nodes might be replaced by powerful mobile User Terminals. On top of it, Generic Autonomic Network Architecture would help accommodate the fact that network devices may expose autonomic cooperative behaviors, allowing them to play certain roles. Finally, such a network must interact with Operations Support System deployed by the network operator for uninterrupted, continued operation.

Author(s):  
Michal Wódczak

The current efforts across industry and academia are to develop new paradigms that enable ubiquitous on-demand service provision. This aim may be achievable because of the envisaged deployment of cutting-edge technologies such as cooperative transmission. However, a real advancement is only attainable when autonomic system design principles are taken into account. Looking at the concept of the Relay Enhanced Cell, one may come across commonalities with Mobile Ad-hoc Networks. Especially in Local Area scenarios, Base Stations seem to resemble advanced Access Points, while fixed and movable Relay Nodes might be replaced by powerful mobile User Terminals. On top of it, Generic Autonomic Network Architecture would help accommodate the fact that network devices may expose autonomic cooperative behaviors, allowing them to play certain roles. Finally, such a network must interact with Operations Support System deployed by the network operator for uninterrupted, continued operation.


2021 ◽  
Author(s):  
Salah Abdulhadi

Cooperative transmission has been recently proposed as a promising technique to combat multi-path fading and increased link reliability. It represents a potential candidate to exploit the benefits of using multiple antennas system without requiring to implement multiple antennas per terminal. There has been extensive research investigating physical layer issues of such systems; however, higher layer protocols that exploit cooperative links in ad hoc networks are still emerging in cooperative ad hoc networks, and it is important to effectively use cooperation without affecting the performance of the network. In this dissertation, we proposed a novel a characterization of the optimal multi-hop cooperative routing in ad hoc networks, and developed a metric for both evaluation. The key advantages of cooperative links are to minimize the number of hops while maintaining the QoS requirements and to minimize the end-to-end total power for a given rate. Also we showed that energy can be used more efficiently if we determine the joint optimal packet size and the optimal power allocation for both the source and the relay. For multi-flow scenario, we have proposed a clique-based inter-flow interference abstraction, and used the linear programming formulation to study the capacity gain of ad-hoc cooperative network. It is observed that the network capacity in multi-hop multi-flow settings is severely affected by interference between links and this effect increases when the cooperative relaying is imposed.


2015 ◽  
Author(s):  
Κωνσταντίνος Χούμας

Παρόλο που τα καθημερινά σενάρια χρήσης της ασύρματης δικτύωσης βασίζονται συνήθως σε κάποια μορφή υποδομής, όπως είναι τα σημεία πρόσβασης (access points) ή οι σταθμοί βάσης (base stations), υπάρχει εξίσου μεγάλο ενδιαφέρον και για τα ασύρματα αδόμητα δίκτυα. Υπάρχει μία πληθώρα σεναρίων που χρειάζονται ασύρματη συνδεσιμότητα και δεν μπορούν να υποστηριχτούν χωρίς την ασύρματη αδόμητη δικτύωση. Ωστόσο, η αποδοτική χρήση των ασύρματων αδόμητων δικτύων είναι στενά συνδεδεμένη με το πρόβλημα της αποδοτικής ανάθεσης πόρων. Η ανάθεση πόρων στα ασύρματα αδόμητα δίκτυα είναι ένα πρόβλημα με πολλές προκλήσεις, με πολλαπλά υπό διερεύνηση θέματα που σχετίζονται με την δρομολόγηση πακέτων, τον χρονικό καθορισμό των μεταδόσεων όπως και την προσαρμογή των ρυθμών εισαγωγής πακέτων μέσα στο δίκτυο. Σε αυτή την διατριβή, προτείνουμε καινοτόμα σχήματα που απαντούν σε αυτές τις προκλήσεις, χρησιμοποιώντας πρακτικές και ιδέες που προκύπτουν από τον Backpressure αλγόριθμο και την Opportunistic routing λογική. Εναλλακτικά, είτε αποδεικνύουμε μαθηματικά ότι τα προτεινόμενα σχήματα έχουν βέλτιστη συμπεριφορά, είτε υιοθετούμε ευριστικές προσεγγίσεις. Η αξιολόγηση τους βασίζεται σε πειραματισμό σε μεγάλης κλίμακας ασύρματες πειραματικές υποδομές και διευρυμένα εργαλεία λογισμικού που καλύπτουν τις δικές μας πειραματικές ανάγκες. Η δυνατότητα για ένα τέτοιο πειραματισμό προκύπτει από την δουλειά μας για επέκταση ενός αναγνωρισμένου λογισμικού για διαχείριση τέτοιων υποδομών. Τα αποτελέσματα της αξιολόγησης μας είναι πολλαπλώς υποσχόμενα, καθότι συγκρίνουμε τους αλγόριθμους μας με άλλους αναγνωρισμένους αλγόριθμους και δείχνουμε σημαντικές βελτιώσεις σε σχέση με τους δεύτερους.


2012 ◽  
Vol 224 ◽  
pp. 520-523
Author(s):  
Hyun Jong Cha ◽  
Jin Mook Kim ◽  
Hwang Bin Ryou

A mobile ad-hoc network is a method of communication between different nodes (mobile devices) without the use of base stations, which are used in wired networks. In a Mobile ad-hoc network, nodes can play the role of a receiver, sender, or a relay. As movement is flexible in Mobile ad-hoc networks and nodes have limited resources, nodes may join the communication or exit it at any time. Therefore, for Mobile ad-hoc networks, routing techniques - selecting communication routes and maintaining them – is considered important in an environment of constantly changing network topology. To overcome this problem, this paper proposes a reliable routing protocol based on MP-AOMDV, which monitors changes in signal strength not only for GPS signals but reception signals as well. Although MP-AOMDV was researched under the assumption of fixed movement direction and speed, this paper proposes a routing technique that works with changing movement direction or speed of nodes.


Author(s):  
Jyoti Sekhar Banerjee ◽  
Arpita Chakraborty

Today's wireless networks are characterized by fixed spectrum assignment policy. The spectral scarcity and the inefficiency in the spectrum usage necessitate new communication paradigms to exploit the existing wireless spectrum, opportunistically. Software Defined Radio (SDR) and Cognitive Radio (CR) are the very paradigms for wireless communication, in which either a network or a wireless node reconfigures its transmission or reception parameters to communicate efficiently, avoiding interference with licensed or unlicensed users. CR adapts itself to the newer environment on the basis of its intelligent sensing and captures the best available spectrum to meet user communication requirements. When the radio link features are extended to the network layer, the cognitive radios form the cognitive radio network. This chapter is focused on software defined radio, its architecture, its limitations, evolution to cognitive radio network, architecture of the CR, and its relevance in wireless and mobile ad-hoc networks.


Author(s):  
Shaik Shakeel Ahamad ◽  
V. N. Sastry ◽  
Siba K. Udgata

In this chapter, the authors propose a secure payment framework in mobile ad hoc network for disaster areas. In order to enable transactions in a disaster area using existing payment systems, we need infrastructure to communicate such as wired networks and base stations for cellular networks which are damaged by natural disasters. The authors propose to use mobile agent technology and digital signature with message recovery (DSMR) mechanism based on ECDSA mechanism to enable transactions in a disaster area using ad hoc networks.


Author(s):  
Rakesh Kumar Singh

Mobile Ad Hoc Network (MANET) is a collection of communication devices or nodes that wish to communicate without any fixed infrastructure. The nodes in MANET themselves are responsible for dynamically discovering other nodes to communicate. A number of challenges like open peer-to-peer network architecture, stringent resource constraints, shared wireless medium, dynamic network topology etc. are posed in MANET. In this research, we identify the existent security threats an ad hoc network faces, the security services required to be achieved and the countermeasures for attacks in each layer. To accomplish our goal, we have done literature survey in gathering information related to various types of attacks and solutions, as well as we have made comparative study to address the threats in different layers. Finally, we have identified the challenges and proposed solutions to overcome them. There is no general algorithm that suits well against the most commonly known attacks such as wormhole, rushing attack, etc.


Sensors ◽  
2019 ◽  
Vol 19 (10) ◽  
pp. 2252 ◽  
Author(s):  
Yimin Zhao ◽  
Song Xiao ◽  
Hongping Gan ◽  
Lizhao Li ◽  
Lina Xiao

In wireless multi-hop networks, instead of using the traditional store-and-forward method, the relay nodes can exploit the network coding idea to encode and transmit the packets in the distributed coding-aware routing (DCAR) mechanisms, which can decrease the transmission number and achieve higher throughput. However, depending on the primary coding conditions of DCAR, the DCAR-type schemes may not only detect more coding opportunities, but also lead to an imbalanced distribution of the network load. Especially, they are not energy efficient in more complex scenarios, such as wireless ad-hoc networks. In this paper, to solve these shortcomings, we propose a constrained coding-aware routing (CCAR) mechanism with the following benefits: (1) by the constrained coding conditions, the proposed mechanism can detect good coding opportunities and assure a higher decoding probability; (2) we propose a tailored “routing + coding” discovery process, which is more lightweight and suitable for the CCAR scheme; and (3) by evaluating the length of the output queue, we can estimate the states of coding nodes to improve the efficient coding benefit. To those ends, we implement the CCAR scheme in different topologies with the ns-2 simulation tool. The simulation results show that a higher effective coding benefit ratio can be achieved by the constrained coding conditions and new coding benefit function. Moreover, the CCAR scheme has significant advantages regarding throughput, average end-to-end delay, and energy consumption.


2013 ◽  
Vol 756-759 ◽  
pp. 1059-1062 ◽  
Author(s):  
Xue Bing Wang

By making small adjustment to general ad hoc network architecture, we build a network topology with short average path length and high clustering coefficient, which are two important metrics of ad hoc networks. Furthermore, an efficient probabilistic flooding routing algorithm is proposed based on this network model. Simulation results show that this architecture behaves better performance than its ordinary counterpart.


Sign in / Sign up

Export Citation Format

Share Document