Review: Dynamic key management in wireless sensor networks: A survey

Mobile sink Wireless Sensor Network (MSWSN) has recently received a lot of attention from the research community. Its appealing characteristics of providing longer network lifetimes, delay optimizations and the flexibility to adapt dissemination strategies according to applications' requirements have proved to be more efficient. Numerous mobile sink based data dissemination strategies have been proposed. This work presents state of the art literature review on MSWSN data dissemination strategies. Issues and flexibilities that did not exist with static sink WSN have been discussed. A classification of available data dissemination strategies and their pros and cons has been discussed.

Data dissemination strategies in mobile sink Wireless Sensor Networks: A survey

https://hal.archives-ouvertes.fr/hal-01303918/document

Forwarder smart selection protocol for limitation of broadcast storm problem

The NNN-UTS project (Nordomradenes Nye Nervesystem – Undervanns Tradlost Sensornettverk) has aimed to develop wireless network technology for underwater sensor networks, employing acoustic communication to realize wireless functionality in water. Research and development has been carried out in 2006-2009. A final sea test/demonstration of the system was carried out at Breiangen in the Oslo fjord, on December 3-4 2009. The result is a fully operative network system available for water depths down to 4000m.

Underwater Wireless Sensor Network

Security is a critical issue for sensor networks used in hostile environments. When wireless sensor nodes in a wireless sensor network are distributed in an insecure hostile environment, the sensor nodes must be protected: a secret key must be used to protect the nodes transmitting messages. If the nodes are not protected and become compromised, many types of attacks against the network may result. Such is the case with existing schemes, which are vulnerable to attacks because they mostly provide a hop-by-hop paradigm, which is insufficient to defend against known attacks. We propose a location-aware dynamic session-key management protocol for grid-based wireless sensor networks. The proposed protocol improves the security of a secret key. The proposed scheme also includes a key that is dynamically updated. This dynamic update can lower the probability of the key being guessed correctly. Thus currently known attacks can be defended. By utilizing the local information, the proposed scheme can also limit the flooding region in order to reduce the energy that is consumed in discovering routing paths.

/pdf/location-aware-dynamic-session-key-management-for-grid-based-40557o6rk7.pdf

Location-Aware Dynamic Session-Key Management for Grid-Based Wireless Sensor Networks

This work proposes efficient data aggregation algorithms based on a virtual grid for range query in wireless sensor networks. A sensor node is selected to be a manager, called head, in each grid. The responsibilities of head are to detect generated event, announce to all other heads, and respond to a moving user. A user obtains the occurred event information from its grid head. If a user is interested in an event, it issues a query to acquire data from a specified regular-shape or spreading irregular-shape ranges. Users can oversee the spreading event via querying the incurred irregular-shape range. In addition, this work proposes efficient approaches to gather data from sensor networks while voids exist. Finally, experimental results show that the proposed approaches are more energy-efficiency than the existing approach.

Data Aggregation for Range Query in Wireless Sensor Networks

This work proposes efficient data aggregation algorithms for range query in wireless sensor networks The proposed aggregation and query mechanisms are based on a virtual grid in sensor networks A sensor node is selected to be a manager, named head, in each grid The head node detects the generated event, announces event to all heads, and responds the query of mobile users A user obtains the occurred event information from its grid head If a user is interested in the event, it issues a query to acquire data of a specified regular-shape or spreading irregular-shape ranges User can designate a regular range for querying To track the diffusing event, this work proposes an efficient distributed algorithm for a dynamic tree structure in sensor networks Users can oversee the spreading event via querying the incurred irregular-shape range Additionally, this work proposes efficient approaches to gather data from sensor networks when voids exist Finally, experimental results show that the proposed approaches are more energy-efficiency than the existing approach

Data aggregation of range querying for grid-based sensor networks

Applications in Vehicular Ad Hoc Networks

A query-based wireless sensor network may generate frequent queries to a specific node, and then a hotspot problem emerges and fast consumes the energy of the specific node. A hotspot also influences the traffic flow near its neighboring area. To solve the hotspot problem, this paper presents two agents setting algorithms, distance-based agent selection (DAS) and greedy-based agent selection (GAS) to mitigate the traffic flow near hotspot. A sensor node, called limb node, is attached an agent that is responsible for aggregating query packets to hotspot and replying the interested data to the corresponding requestors. By assigning agents, DAS and GAS both mitigate the hotspot phenomenon. This paper investigates and simulates the proposed algorithms in different environment conditions. From simulation results, both DAS and GAS can mitigate the traffic rates of hotspot up to 60%.

Yi-Shiang Chang

Papers

Data Aggregation for Range Query in Wireless Sensor Networks

Data aggregation of range querying for grid-based sensor networks

Applications in Vehicular Ad Hoc Networks

Mitigating query hotspots for wireless sensor networks