4,633 research outputs found
AMCTD: Adaptive Mobility of Courier nodes in Threshold-optimized DBR Protocol for Underwater Wireless Sensor Networks
In dense underwater sensor networks (UWSN), the major confronts are high
error probability, incessant variation in topology of sensor nodes, and much
energy consumption for data transmission. However, there are some remarkable
applications of UWSN such as management of seabed and oil reservoirs,
exploration of deep sea situation and prevention of aqueous disasters. In order
to accomplish these applications, ignorance of the limitations of acoustic
communications such as high delay and low bandwidth is not feasible. In this
paper, we propose Adaptive mobility of Courier nodes in Threshold-optimized
Depth-based routing (AMCTD), exploring the proficient amendments in depth
threshold and implementing the optimal weight function to achieve longer
network lifetime. We segregate our scheme in 3 major phases of weight updating,
depth threshold variation and adaptive mobility of courier nodes. During data
forwarding, we provide the framework for alterations in threshold to cope with
the sparse condition of network. We ultimately perform detailed simulations to
scrutinize the performance of our proposed scheme and its comparison with other
two notable routing protocols in term of network lifetime and other essential
parameters. The simulations results verify that our scheme performs better than
the other techniques and near to optimal in the field of UWSN.Comment: 8th International Conference on Broadband and Wireless Computing,
Communication and Applications (BWCCA'13), Compiegne, Franc
Simplicial Homology for Future Cellular Networks
Simplicial homology is a tool that provides a mathematical way to compute the
connectivity and the coverage of a cellular network without any node location
information. In this article, we use simplicial homology in order to not only
compute the topology of a cellular network, but also to discover the clusters
of nodes still with no location information. We propose three algorithms for
the management of future cellular networks. The first one is a frequency
auto-planning algorithm for the self-configuration of future cellular networks.
It aims at minimizing the number of planned frequencies while maximizing the
usage of each one. Then, our energy conservation algorithm falls into the
self-optimization feature of future cellular networks. It optimizes the energy
consumption of the cellular network during off-peak hours while taking into
account both coverage and user traffic. Finally, we present and discuss the
performance of a disaster recovery algorithm using determinantal point
processes to patch coverage holes
On Mobility Management in Multi-Sink Sensor Networks for Geocasting of Queries
In order to efficiently deal with location dependent messages in multi-sink wireless sensor networks (WSNs), it is key that the network informs sinks what geographical area is covered by which sink. The sinks are then able to efficiently route messages which are only valid in particular regions of the deployment. In our previous work (see the 5th and 6th cited documents), we proposed a combined coverage area reporting and geographical routing protocol for location dependent messages, for example, queries that are injected by sinks. In this paper, we study the case where we have static sinks and mobile sensor nodes in the network. To provide up-to-date coverage areas to sinks, we focus on handling node mobility in the network. We discuss what is a better method for updating the routing structure (i.e., routing trees and coverage areas) to handle mobility efficiently: periodic global updates initiated from sinks or local updates triggered by mobile sensors. Simulation results show that local updating perform very well in terms of query delivery ratio. Local updating has a better scalability to increasing network size. It is also more energy efficient than ourpreviously proposed approach, where global updating in networks have medium mobility rate and speed
Combined Coverage Area Reporting and Geographical Routing in Wireless Sensor-Actuator Networks for Cooperating with Unmanned Aerial Vehicles
In wireless sensor network (WSN) applications with multiple gateways, it is key to route location dependent subscriptions efficiently at two levels in the system. At the gateway level, data sinks must not waste the energy of the WSN by injecting subscriptions that are not relevant for the nodes in their coverage area and at WSN level, energy-efficient delivery of subscriptions to target areas is required. In this paper, we propose a mechanism in which (1) the WSN provides an accurate and up-to-date coverage area description to gateways and (2) the wireless sensor network re-uses the collected coverage area information to enable efficient geographical routing of location dependent subscriptions and other messages. The latter has a focus on routing of messages injected from sink nodes to nodes in the region of interest. Our proposed mechanisms are evaluated in simulation
Design of Combined Coverage Area Reporting and Geo-casting of Queries for Wireless Sensor Networks
In order to efficiently deal with queries or other location dependent information, it is key that the wireless sensor network informs gateways what geographical area is serviced by which gateway. The gateways are then able to e.g. efficiently route queries which are only valid in particular regions of the deployment. The proposed algorithms combine coverage area reporting and geographical routing of queries which are injected by gateways.\u
Energy-aware Dual-path Geographic Routing to Bypass Routing Holes in Wireless Sensor Networks
This is the author accepted manuscript. The final version is available from IEEE via the DOI in this record.Geographic routing has been considered as an attractive approach for resource-constrained wireless sensor networks
(WSNs) since it exploits local location information instead of global topology information to route data. However, this routing approach
often suffers from the routing hole (i.e., an area free of nodes in the direction closer to destination) in various environments such as
buildings and obstacles during data delivery, resulting in route failure. Currently, existing geographic routing protocols tend to walk
along only one side of the routing holes to recover the route, thus achieving suboptimal network performance such as longer delivery
delay and lower delivery ratio. Furthermore, these protocols cannot guarantee that all packets are delivered in an energy-efficient
manner once encountering routing holes. In this paper, we focus on addressing these issues and propose an energy-aware dual-path
geographic routing (EDGR) protocol for better route recovery from routing holes. EDGR adaptively utilizes the location information,
residual energy, and the characteristics of energy consumption to make routing decisions, and dynamically exploits two node-disjoint
anchor lists, passing through two sides of the routing holes, to shift routing path for load balance. Moreover, we extend EDGR into
three-dimensional (3D) sensor networks to provide energy-aware routing for routing hole detour. Simulation results demonstrate that
EDGR exhibits higher energy efficiency, and has moderate performance improvements on network lifetime, packet delivery ratio, and
delivery delay, compared to other geographic routing protocols in WSNs over a variety of communication scenarios passing through
routing holes. The proposed EDGR is much applicable to resource-constrained WSNs with routing holes.This work has been partially supported by the National
Natural Science Foundation of China (No. 61402343,
No. 61672318, No. U1504614, No. 61631013, and No.
61303241), the National Key Research and Development
Program (No. 2016YFB1000102), the Natural Science
Foundation of Suzhou/Jiangsu Province (No.
BK20160385), the EU FP7 QUICK Project (No. PIRSESGA-
2013-612652), and the projects of Tsinghua National
Laboratory for Information Science and Technology
(TNList)
- âŚ