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

Distributed Coverage Area Reporting for Wireless Sensor Networks

In order to efficiently deal with subscriptions or other location dependent information, it is key that the wireless sensor network informs the gateways what geographical area is serviced by which gateway. The gateways are then able to e.g. efficiently route subscriptions which are only valid in particular regions of the deployment. \ud \ud In our distributed approach of establishing a description of WSN coverage area per gateway, we let nodes keep track of the convex hull of the coverage area. In this way, gateways are efficiently informed of the service areas, while we limit the amount of information each node needs to store, transmit and receive

1-D Coordinate Based on Local Information for MAC and Routing Issues in WSNs

More and more critical Wireless Sensor Networks (WSNs) applications are emerging. Those applications need reliability and respect of time constraints. The underlying mechanisms such as MAC and routing must handle such requirements. Our approach to the time constraint problem is to bound the hop-count between a node and the sink and the time it takes to do a hop so the end-to-end delay can be bounded and the communications are thus real-time. For reliability purpose we propose to select forwarder nodes depending on how they are connected in the direction of the sink. In order to be able to do so we need a coordinate (or a metric) that gives information on hop-count, that allows to strongly differentiate nodes and gives information on the connectivity of each node keeping in mind the intrinsic constraints of WSWs such as energy consumption, autonomy, etc. Due to the efficiency and scalability of greedy routing in WSNs and the financial cost of GPS chips, Virtual Coordinate Systems (VCSs) for WSNs have been proposed. A category of VCSs is based on the hop-count from the sink, this scheme leads to many nodes having the same coordinate. The main advantage of this system is that the hops number of a packet from a source to the sink is known. Nevertheless, it does not allow to differentiate the nodes with the same hop-count. In this report we propose a novel hop-count-based VCS which aims at classifying the nodes having the same hop-count depending on their connectivity and at differentiating nodes in a 2-hop neighborhood. Those properties make the coordinates, which also can be viewed as a local identifier, a very powerful metric which can be used in WSNs mechanisms.Comment: (2011

Sparse Localization with a Mobile Beacon Based on LU Decomposition in Wireless Sensor Networks

Node localization is the core in wireless sensor network. It can be solved by powerful beacons, which are equipped with global positioning system devices to know their location information. In this article, we present a novel sparse localization approach with a mobile beacon based on LU decomposition. Our scheme firstly translates node localization problem into a 1-sparse vector recovery problem by establishing sparse localization model. Then, LU decomposition pre-processing is adopted to solve the problem that measurement matrix does not meet the re¬stricted isometry property. Later, the 1-sparse vector can be exactly recovered by compressive sensing. Finally, as the 1-sparse vector is approximate sparse, weighted Cen¬troid scheme is introduced to accurately locate the node. Simulation and analysis show that our scheme has better localization performance and lower requirement for the mobile beacon than MAP+GC, MAP-M, and MAP-M&N schemes. In addition, the obstacles and DOI have little effect on the novel scheme, and it has great localization performance under low SNR, thus, the scheme proposed is robust

Localization for Anchoritic Sensor Networks

We introduce a class of anchoritic sensor networks, where communications between sensor nodes is undesirable or infeasible, e.g., due to harsh environment, energy constraints, or security considerations

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 Efficient Routing Protocols and algorithms for Wireless Sensor Networks a A Survey

Wireless Sensor Networks (WSNs) are an emerging technology for monitoring physical world. The sensor nodes are capable of sensing various types of environmental conditions, have some processing capabilities and ability to communicate the sensed data through wireless communication. Routing algorithms for WSNs are responsible for selecting and maintaining the routes in the network and ensure reliable and effective communication in limited periods. The energy constraint of WSNs make energy saving become the most important objective of various routing algorithms. In this paper, a survey of routing protocols and algorithms used in WSNs is presented with energy efficiency as the main goal

Smartening the Environment using Wireless Sensor Networks in a Developing Country

The miniaturization process of various sensing devices has become a reality by enormous research and advancements accomplished in Micro Electro-Mechanical Systems (MEMS) and Very Large Scale Integration (VLSI) lithography. Regardless of such extensive efforts in optimizing the hardware, algorithm, and protocols for networking, there still remains a lot of scope to explore how these innovations can all be tied together to design Wireless Sensor Networks (WSN) for smartening the surrounding environment for some practical purposes. In this paper we explore the prospects of wireless sensor networks and propose a design level framework for developing a smart environment using WSNs, which could be beneficial for a developing country like Bangladesh. In connection to this, we also discuss the major aspects of wireless sensor networks.Comment: 5 page