4,319 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
Clustering algorithm in initialization of multi-hop wireless sensor networks
In most application scenarios of wireless sensor networks (WSN), sensor nodes are usually deployed randomly and do not have any knowledge about the network environment or even their ID's at the initial stage of their operations. In this paper, we address the clustering problems with a newly deployed multi-hop WSN where most existing clustering algorithms can hardly be used due to the absence of MAC link connections among the nodes. We propose an effective clustering algorithm based on a random contention model without the prior knowledge of the network and the ID's of nodes. Computer simulations have been used to show the effectiveness of the algorithm with a relatively low complexity if compared with existing schemes
Self-Synchronization in Duty-cycled Internet of Things (IoT) Applications
In recent years, the networks of low-power devices have gained popularity.
Typically these devices are wireless and interact to form large networks such
as the Machine to Machine (M2M) networks, Internet of Things (IoT), Wearable
Computing, and Wireless Sensor Networks. The collaboration among these devices
is a key to achieving the full potential of these networks. A major problem in
this field is to guarantee robust communication between elements while keeping
the whole network energy efficient. In this paper, we introduce an extended and
improved emergent broadcast slot (EBS) scheme, which facilitates collaboration
for robust communication and is energy efficient. In the EBS, nodes
communication unit remains in sleeping mode and are awake just to communicate.
The EBS scheme is fully decentralized, that is, nodes coordinate their wake-up
window in partially overlapped manner within each duty-cycle to avoid message
collisions. We show the theoretical convergence behavior of the scheme, which
is confirmed through real test-bed experimentation.Comment: 12 Pages, 11 Figures, Journa
M-ATTEMPT: A New Energy-Efficient Routing Protocol for Wireless Body Area Sensor Networks
In this paper, we propose a new routing protocol for heterogeneous Wireless
Body Area Sensor Networks (WBASNs); Mobility-supporting Adaptive
Threshold-based Thermal-aware Energy-efficientMulti-hop ProTocol (M-ATTEMPT). A
prototype is defined for employing heterogeneous sensors on human body. Direct
communication is used for real-time traffic (critical data) or on-demand data
while Multi-hop communication is used for normal data delivery. One of the
prime challenges in WBASNs is sensing of the heat generated by the implanted
sensor nodes. The proposed routing algorithm is thermal-aware which senses the
link Hot-spot and routes the data away from these links. Continuous mobility of
human body causes disconnection between previous established links. So,
mobility support and energy-management is introduced to overcome the problem.
Linear Programming (LP) model for maximum information extraction and minimum
energy consumption is presented in this study. MATLAB simulations of proposed
routing algorithm are performed for lifetime and successful packet delivery in
comparison with Multi-hop communication. The results show that the proposed
routing algorithm has less energy consumption and more reliable as compared to
Multi-hop communication.Comment: arXiv admin note: substantial text overlap with arXiv:1208.609
Distributed Clustering in Cognitive Radio Ad Hoc Networks Using Soft-Constraint Affinity Propagation
Absence of network infrastructure and heterogeneous spectrum availability in cognitive radio ad hoc networks (CRAHNs) necessitate the self-organization of cognitive radio users (CRs) for efficient spectrum coordination. The cluster-based structure is known to be effective in both guaranteeing system performance and reducing communication overhead in variable network environment. In this paper, we propose a distributed clustering algorithm based on soft-constraint affinity propagation message passing model (DCSCAP). Without dependence on predefined common control channel (CCC), DCSCAP relies on the distributed message passing among CRs through their available channels, making the algorithm applicable for large scale networks. Different from original soft-constraint affinity propagation algorithm, the maximal iterations of message passing is controlled to a relatively small number to accommodate to the dynamic environment of CRAHNs. Based on the accumulated evidence for clustering from the message passing process, clusters are formed with the objective of grouping the CRs with similar spectrum availability into smaller number of clusters while guaranteeing at least one CCC in each cluster. Extensive simulation results demonstrate the preference of DCSCAP compared with existing algorithms in both efficiency and robustness of the clusters
Transform-based Distributed Data Gathering
A general class of unidirectional transforms is presented that can be
computed in a distributed manner along an arbitrary routing tree. Additionally,
we provide a set of conditions under which these transforms are invertible.
These transforms can be computed as data is routed towards the collection (or
sink) node in the tree and exploit data correlation between nodes in the tree.
Moreover, when used in wireless sensor networks, these transforms can also
leverage data received at nodes via broadcast wireless communications. Various
constructions of unidirectional transforms are also provided for use in data
gathering in wireless sensor networks. New wavelet transforms are also proposed
which provide significant improvements over existing unidirectional transforms
Selecting source image sensor nodes based on 2-hop information to improve image transmissions to mobile robot sinks in search \& rescue operations
We consider Robot-assisted Search Rescue operations enhanced with some
fixed image sensor nodes capable of capturing and sending visual information to
a robot sink. In order to increase the performance of image transfer from image
sensor nodes to the robot sinks we propose a 2-hop neighborhood
information-based cover set selection to determine the most relevant image
sensor nodes to activate. Then, in order to be consistent with our proposed
approach, a multi-path extension of Greedy Perimeter Stateless Routing (called
T-GPSR) wherein routing decisions are also based on 2-hop neighborhood
information is proposed. Simulation results show that our proposal reduces
packet losses, enabling fast packet delivery and higher visual quality of
received images at the robot sink
- …