824 research outputs found
Randomized Initialization of a Wireless Multihop Network
Address autoconfiguration is an important mechanism required to set the IP
address of a node automatically in a wireless network. The address
autoconfiguration, also known as initialization or naming, consists to give a
unique identifier ranging from 1 to for a set of indistinguishable
nodes. We consider a wireless network where nodes (processors) are randomly
thrown in a square , uniformly and independently. We assume that the network
is synchronous and two nodes are able to communicate if they are within
distance at most of of each other ( is the transmitting/receiving
range). The model of this paper concerns nodes without the collision detection
ability: if two or more neighbors of a processor transmit concurrently at
the same time, then would not receive either messages. We suppose also that
nodes know neither the topology of the network nor the number of nodes in the
network. Moreover, they start indistinguishable, anonymous and unnamed. Under
this extremal scenario, we design and analyze a fully distributed protocol to
achieve the initialization task for a wireless multihop network of nodes
uniformly scattered in a square . We show how the transmitting range of the
deployed stations can affect the typical characteristics such as the degrees
and the diameter of the network. By allowing the nodes to transmit at a range
r= \sqrt{\frac{(1+\ell) \ln{n} \SIZE}{\pi n}} (slightly greater than the one
required to have a connected network), we show how to design a randomized
protocol running in expected time in order to assign a
unique number ranging from 1 to to each of the participating nodes
Connectivity Investigation of Channel Quality-Based Adaptive Gossip Flooding Mechanism for AODV
To address the âbroadcast stormâ problem associated with flooding-based route discovery mechanism of reactive routing protocols, probabilistic approaches are suggested in the literature. In the earlier work, Gossip flooding mechanism of Haas et.al. was extended with signal quality, to propose channel quality based adaptive gossip flooding mechanism for AODV (CQAG-AODV). Following the cross-layer design principle, CQAG-AODV algorithm tried to discover robust routes, as well as address the âbroadcast stormâ problem by controlling the rebroadcast probability of Route request (RREQ) packets on the basis of signal strength experienced at the physical layer. This paper investigates the connectivity of CQAG-AODV through theoretical and simulation analysis. Results show that, by accounting the signal strength in the route discovery process, not only does the proposed algorithm floods a lesser number of route requests and controls the broadcast storm, but also maintains a higher level of connectivity to offer high packet delivery ratio; independent of network density and node mobility. Moreover, due to controlled routing overhead and robust route discovery, channel quality based adaptive flooding mechanism offers fringe benefit of energy efficiency as well. CQAG-AODV thus proves its suitability in a variety of use cases of multi-hop ad hoc networks including WSNs and VANETs
On the performance of probabilistic flooding in wireless mobile ad hoc networks
Broadcasting in MANETâs has traditionally been based on flooding, but this can induce broadcast storms that severely degrade network performance due to redundant retransmission, collision and contention.
Probabilistic flooding, where a node rebroadcasts a newly arrived one-to-all packet with some probability, p, was an early suggestion to reduce the broadcast storm problem. The first part of this thesis investigates the effects on the performance of probabilistic flooding of a number of important MANET parameters, including node speed, traffic load and node density. It transpires that these parameters have a critical impact both on reachability and on the number of so-called âsaved rebroadcast packetsâ achieved. For instance, across a range of rebroadcast probability values, as network density increases from 25 to 100 nodes, reachability achieved by probabilistic flooding increases from 85% to 100%. Moreover, as node speed increases from 2 to 20 m/sec, reachability increases from 90% to 100%.
The second part of this thesis proposes two new probabilistic algorithms that dynamically adjust the rebroadcasting probability contingent on node distribution using only one-hop neighbourhood information, without requiring any assistance of distance measurements or location-determination devices. The performance of the new algorithm is assessed and compared to blind flooding as well as the fixed probabilistic approach. It is demonstrated that the new algorithms have superior performance characteristics in terms of both reachability and saved rebroadcasts. For instance, the suggested algorithms can improve saved rebroadcasts by up to 70% and 47% compared to blind and fixed probabilistic flooding, respectively, even under conditions of high node mobility and high network density without degrading reachability. The final part of the thesis assesses the impact of probabilistic flooding on the performance of routing protocols in MANETs. Our performance results indicate that using our new probabilistic flooding algorithms during route discovery enables AODV to achieve a higher delivery ratio of data packets while keeping a lower routing overhead compared to using blind and fixed probabilistic flooding. For instance, the packet delivery ratio using our algorithm is improved by up to 19% and 12% compared to using blind and fixed probabilistic flooding, respectively. This performance advantage is achieved with a routing overhead that is lower by up to 28% and 19% than in fixed probabilistic and blind flooding, respectively
Improved User Tracking in 5G Millimeter Wave Mobile Networks via Refinement Operations
The millimeter wave (mmWave) frequencies offer the availability of huge
bandwidths to provide unprecedented data rates to next-generation cellular
mobile terminals. However, directional mmWave links are highly susceptible to
rapid channel variations and suffer from severe isotropic pathloss. To face
these impairments, this paper addresses the issue of tracking the channel
quality of a moving user, an essential procedure for rate prediction, efficient
handover and periodic monitoring and adaptation of the user's transmission
configuration. The performance of an innovative tracking scheme, in which
periodic refinements of the optimal steering direction are alternated to
sparser refresh events, are analyzed in terms of both achievable data rate and
energy consumption, and compared to those of a state-of-the-art approach. We
aim at understanding in which circumstances the proposed scheme is a valid
option to provide a robust and efficient mobility management solution. We show
that our procedure is particularly well suited to highly variant and unstable
mmWave environments.Comment: Accepted for publication to the 16th IEEE Annual Mediterranean Ad Hoc
Networking Workshop (MED-HOC-NET), Jun. 201
Topology Control Multi-Objective Optimisation in Wireless Sensor Networks: Connectivity-Based Range Assignment and Node Deployment
The distinguishing characteristic that sets topology control apart from other methods, whose motivation is to achieve effects of energy minimisation and an increased network capacity, is its network-wide perspective. In other words, local choices made at the node-level always have the goal in mind of achieving a certain global, network-wide property, while not excluding the possibility for consideration of more localised factors. As such, our approach is marked by being a centralised computation of the available location-based data and its reduction to a set of non-homogeneous transmitting range assignments, which elicit a certain network-wide property constituted as a whole, namely, strong connectedness and/or biconnectedness.
As a means to effect, we propose a variety of GA which by design is multi-morphic, where dependent upon model parameters that can be dynamically set by the user, the algorithm, acting accordingly upon either single or multiple objective functions in response. In either case, leveraging the unique faculty of GAs for finding multiple optimal solutions in a single pass. Wherefore it is up to the designer to select the singular solution which best meets requirements.
By means of simulation, we endeavour to establish its relative performance against an optimisation typifying a standard topology control technique in the literature in terms of the proportion of time the network exhibited the property of strong connectedness.
As to which, an analysis of the results indicates that such is highly sensitive to factors of: the effective maximum transmitting range, node density, and mobility scenario under observation. We derive an estimate of the optimal constitution thereof taking into account the specific conditions within the domain of application in that of a WSN, thereby concluding that only GA optimising for the biconnected components in a network achieves the stated objective of a sustained connected status throughout the duration.fi=OpinnÀytetyö kokotekstinÀ PDF-muodossa.|en=Thesis fulltext in PDF format.|sv=LÀrdomsprov tillgÀngligt som fulltext i PDF-format
Cluster based jamming and countermeasures for wireless sensor network MAC protocols
A wireless sensor network (WSN) is a collection of wireless nodes, usually with limited computing resources and available energy. The medium access control layer (MAC layer) directly guides the radio hardware and manages access to the radio spectrum in controlled way. A top priority for a WSN MAC protocol is to conserve energy, however tailoring the algorithm for this purpose can create or expose a number of security vulnerabilities. In particular, a regular duty cycle makes a node vulnerable to periodic jamming attacks. This vulnerability limits the use of use of a WSN in applications requiring high levels of security. We present a new WSN MAC protocol, RSMAC (Random Sleep MAC) that is designed to provide resistance to periodic jamming attacks while maintaining elements that are essential to WSN functionality. CPU, memory and especially radio usage are kept to a minimum to conserve energy while maintaining an acceptable level of network performance so that applications can be run transparently on top of the secure MAC layer. We use a coordinated yet pseudo-random duty cycle that is loosely synchronized across the entire network via a distributed algorithm. This thwarts an attacker\u27s ability to predict when nodes will be awake and likewise thwarts energy efficient intelligent jamming attacks by reducing their effectiveness and energy-efficiency to that of non-intelligent attacks. Implementing the random duty cycle requires additional energy usage, but also offers an opportunity to reduce asymmetric energy use and eliminate energy use lost to explicit neighbor discovery. We perform testing of RSMAC against non-secure protocols in a novel simulator that we designed to make prototyping new WSN algorithms efficient, informative and consistent. First we perform tests of the existing SMAC protocol to demonstrate the relevance of the novel simulation for estimating energy usage, data transmission rates, MAC timing and other relevant macro characteristics of wireless sensor networks. Second, we use the simulation to perform detailed testing of RSMAC that demonstrates its performance characteristics with different configurations and its effectiveness in confounding intelligent jammers
Mobile Ad-Hoc Networks
Being infrastructure-less and without central administration control, wireless ad-hoc networking is playing a more and more important role in extending the coverage of traditional wireless infrastructure (cellular networks, wireless LAN, etc). This book includes state-of the-art techniques and solutions for wireless ad-hoc networks. It focuses on the following topics in ad-hoc networks: vehicular ad-hoc networks, security and caching, TCP in ad-hoc networks and emerging applications. It is targeted to provide network engineers and researchers with design guidelines for large scale wireless ad hoc networks
Mobile Ad-Hoc Networks
Being infrastructure-less and without central administration control, wireless ad-hoc networking is playing a more and more important role in extending the coverage of traditional wireless infrastructure (cellular networks, wireless LAN, etc). This book includes state-of-the-art techniques and solutions for wireless ad-hoc networks. It focuses on the following topics in ad-hoc networks: quality-of-service and video communication, routing protocol and cross-layer design. A few interesting problems about security and delay-tolerant networks are also discussed. This book is targeted to provide network engineers and researchers with design guidelines for large scale wireless ad hoc networks
- âŠ