260 research outputs found
EZ-AG: Structure-free data aggregation in MANETs using push-assisted self-repelling random walks
This paper describes EZ-AG, a structure-free protocol for duplicate
insensitive data aggregation in MANETs. The key idea in EZ-AG is to introduce a
token that performs a self-repelling random walk in the network and aggregates
information from nodes when they are visited for the first time. A
self-repelling random walk of a token on a graph is one in which at each step,
the token moves to a neighbor that has been visited least often. While
self-repelling random walks visit all nodes in the network much faster than
plain random walks, they tend to slow down when most of the nodes are already
visited. In this paper, we show that a single step push phase at each node can
significantly speed up the aggregation and eliminate this slow down. By doing
so, EZ-AG achieves aggregation in only O(N) time and messages. In terms of
overhead, EZ-AG outperforms existing structure-free data aggregation by a
factor of at least log(N) and achieves the lower bound for aggregation message
overhead. We demonstrate the scalability and robustness of EZ-AG using ns-3
simulations in networks ranging from 100 to 4000 nodes under different mobility
models and node speeds. We also describe a hierarchical extension for EZ-AG
that can produce multi-resolution aggregates at each node using only O(NlogN)
messages, which is a poly-logarithmic factor improvement over existing
techniques
QoS Provision for Wireless Sensor Networks
Wireless sensor network is a fast growing area of research, receiving attention not only within the computer science and electrical engineering communities, but also in relation to network optimization, scheduling, risk and reliability analysis within industrial and system engineering. The availability of micro-sensors and low-power wireless communications will enable the deployment of densely distributed sensor/actuator networks. And an integration of such system plays critical roles in many facets of human life ranging from intelligent assistants in hospitals to manufacturing process, to rescue agents in large scale disaster response, to sensor networks tracking environment phenomena, and others.
The sensor nodes will perform significant signal processing, computation, and network self-configuration to achieve scalable, secure, robust and long-lived networks. More specifically, sensor nodes will do local processing to reduce energy costs, and key exchanges to ensure robust communications. These requirements pose interesting challenges for networking research. The most important technical challenge arises from the development of an integrated system which is 1)energy efficient because the system must be long-lived and operate without manual intervention, 2)reliable for data communication and robust to attackers because information security and system robustness are important in sensitive applications, such as military.
Based on the above challenges, this dissertation provides Quality of Service (QoS) implementation and evaluation for the wireless sensor networks. It includes the following 3 modules, 1) energy-efficient routing, 2) energy-efficient coverage, 3). communication security. Energy-efficient routing combines the features of minimum energy consumption routing protocols with minimum computational cost routing protocols. Energy-efficient coverage provides on-demand sensing and measurement. Information security needs a security key exchange scheme to ensure reliable and robust communication links. QoS evaluation metrics and results are presented based on the above requirements
Robotic Wireless Sensor Networks
In this chapter, we present a literature survey of an emerging, cutting-edge,
and multi-disciplinary field of research at the intersection of Robotics and
Wireless Sensor Networks (WSN) which we refer to as Robotic Wireless Sensor
Networks (RWSN). We define a RWSN as an autonomous networked multi-robot system
that aims to achieve certain sensing goals while meeting and maintaining
certain communication performance requirements, through cooperative control,
learning and adaptation. While both of the component areas, i.e., Robotics and
WSN, are very well-known and well-explored, there exist a whole set of new
opportunities and research directions at the intersection of these two fields
which are relatively or even completely unexplored. One such example would be
the use of a set of robotic routers to set up a temporary communication path
between a sender and a receiver that uses the controlled mobility to the
advantage of packet routing. We find that there exist only a limited number of
articles to be directly categorized as RWSN related works whereas there exist a
range of articles in the robotics and the WSN literature that are also relevant
to this new field of research. To connect the dots, we first identify the core
problems and research trends related to RWSN such as connectivity,
localization, routing, and robust flow of information. Next, we classify the
existing research on RWSN as well as the relevant state-of-the-arts from
robotics and WSN community according to the problems and trends identified in
the first step. Lastly, we analyze what is missing in the existing literature,
and identify topics that require more research attention in the future
A Virtual Infrastructure for Mitigating Typical Challenges in Sensor Networks
Sensor networks have their own distinguishing characteristics that set them apart from other types of networks. Typically, the sensors are deployed in large numbers and in random fashion and the resulting sensor network is expected to self-organize in support of the mission for which it was deployed. Because of the random deployment of sensors that are often scattered from an overflying aircraft, the resulting network is not easy to manage since the sensors do not know their location, do not know how to aggregate their sensory data and where and how to route the aggregated data. The limited energy budget available to sensors makes things much worse. To save their energy, sensors have to sleep and wake up asynchronously. However, while promoting energy awareness, these actions continually change the underlying network topology and make the basic network protocols more complex.
Several techniques have been proposed in different areas of sensor networks. Most of these techniques attempt to solve one problem in isolation from the others, hence protocol designers have to face the same common challenges again and again. This, in turn, has a direct impact on the complexity of the proposed protocols and on energy consumption. Instead of using this approach we propose to construct a lightweight backbone that can help mitigate many of the typical challenges in sensor networks and allow the development of simpler network protocols.
Our backbone construction protocol starts by tiling the area around each sink using identical regular hexagons. After that, the closest sensor to the center of each of these hexagons is determined—we refer to these sensors as backbone sensors. We define a ternary coordinate system to refer to hexagons. The resulting system provides a complete set of communication paths that can be used by any geographic routing technique to simplify data communication across the network.
We show how the constructed backbone can help mitigate many of the typical challenges inherent to sensor networks. In addition to sensor localization, the network backbone provides an implicit clustering mechanism in which each hexagon represents a cluster mud the backbone sensor around its center represents the cluster head. As cluster heads, backbone sensors can be used to coordinate task assignment, workforce selection, and data aggregation for different sensing tasks. They also can be used to locally synchronize and adjust the duty cycle of non-backbone sensors in their neighborhood.
Finally, we propose “Backbone Switching”, a technique that creates alternative backbones and periodically switches between them in order to balance energy consumption among sensors by distributing the additional load of being part of the backbone over larger number of sensors
Connectivity, Coverage and Placement in Wireless Sensor Networks
Wireless communication between sensors allows the formation of flexible sensor networks, which can be deployed rapidly over wide or inaccessible areas. However, the need to gather data from all sensors in the network imposes constraints on the distances between sensors. This survey describes the state of the art in techniques for determining the minimum density and optimal locations of relay nodes and ordinary sensors to ensure connectivity, subject to various degrees of uncertainty in the locations of the nodes
A Self-Organization Framework for Wireless Ad Hoc Networks as Small Worlds
Motivated by the benefits of small world networks, we propose a
self-organization framework for wireless ad hoc networks. We investigate the
use of directional beamforming for creating long-range short cuts between
nodes. Using simulation results for randomized beamforming as a guideline, we
identify crucial design issues for algorithm design. Our results show that,
while significant path length reduction is achievable, this is accompanied by
the problem of asymmetric paths between nodes. Subsequently, we propose a
distributed algorithm for small world creation that achieves path length
reduction while maintaining connectivity. We define a new centrality measure
that estimates the structural importance of nodes based on traffic flow in the
network, which is used to identify the optimum nodes for beamforming. We show,
using simulations, that this leads to significant reduction in path length
while maintaining connectivity.Comment: Submitted to IEEE Transactions on Vehicular Technolog
Exploiting random walks for robust, scalable, structure-free data aggregation and routing in mobile ad-hoc networks (MANETs)
The focus of this thesis is on the design of scalable data aggregation protocols for Mobile Ad-hoc Networks (MANETs). Data aggregation Protocols that rely on network structures such as trees or backbones are not well suited for MANETs because the underlying topology of MANETs is constantly changing. On the other hand, unstructured techniques such as flooding and gossiping have a high messaging overhead and take a long time to finish. Therefore, in this thesis, we explore the use of random walks as a structure-free alternative for data aggregation in MANETs.;The basic idea is to introduce one or more tokens that successively visit each node in a MANET by executing a random walk and compute the aggregate state. While random walks are simple, robust and overhead-free, plain random walks tend to be slow in visiting all nodes because the token can get stuck in regions of already visited nodes. Therefore, we first introduce self-repelling random walks (SRRW) in which at each step, the token chooses a neighbor that has been visited the least number of times. While SRRW significantly speeds up random walks in the initial stages, towards the end a slowdown is observed when a significant fraction of nodes are already visited. To address this shortcoming, we then develop two complementary strategies that speed up data aggregation.;First, we introduce gradient biased random walks (a pull-based strategy) where short temporary multi-hop gradients are used to pull the tokens toward unvisited node. We prove that gradient biased random walks achieve a cover time of O(N) and message overhead of O(NlogN) where N is the number of nodes in the network. Next, we introduce a push-based strategy in which self-repelling random walks are complemented by a single step push phase before the random walk phase, in which each node broadcasts its information to its neighbors. We show that this small push goes a long way in speeding up data aggregation. Push based random walks finish data aggregation in O(N) message and time. Finally, we describe hierarchical extension of the push-based protocol which can produce multi-resolution aggregates at each node using only O(NlogN) messages.;All our results are validated using simulations in ns-3 in networks ranging from 100 to 4000 nodes under different network densities, node speed and mobility models
- …