SENDROM: Sensor networks for disaster relief operations management

SENDROM is a new sensor network architecture to manage the rescue operations after large scale disasters. This architecture mainly consists of sensor nodes deployed prior to a disaster and central nodes that can query sensor nodes. Central nodes are stored nearby the emergency operation centers and airports before a disaster. Following a disaster rescue teams are assigned one mobile central node and guided to a region based on the data in the SENDROM database. This paper explains the SENDROM architecture as well as our new task and data dissemination, localization of a detected person, and end-to-end reliable event transfer schemes introduced for SENDROM. Then it evaluates the performance of these schemes analytically and through simulation.     

Quarantine region scheme to mitigate spam attacks in wireless-sensor networks

The quarantine region scheme (QRS) is introduced to defend against spam attacks in wireless sensor networks where malicious antinodes frequently generate dummy spam messages to be relayed toward the sink. The aim of the attacker is the exhaustion of the sensor node batteries and the extra delay caused by processing the spam messages. Network-wide message authentication may solve this problem with a cost of cryptographic operations to be performed over all messages. QRS is designed to reduce this cost by applying authentication only whenever and wherever necessary. In QRS, the nodes that detect a nearby spam attack assume themselves to be in a quarantine region. This detection is performed by intermittent authentication checks. Once quarantined, a node continuously applies authentication measures until the spam attack ceases. In the QRS scheme, there is a trade-off between the resilience against spam attacks and the number of authentications. Our experiments show that, in the worst-case scenario that we considered, a not quarantined node catches 80 percent of the spam messages by authenticating only 50 percent of all messages that it processes.     

Optimal location area design to minimize registration signaling traffic in wireless systems

A new scheme is developed for optimal location area design in wireless systems. New algorithms based on intercell traffic prediction and traffic-based cell grouping are used to select the optimal set of cells for location areas (LAs). The expected intercell movement patterns of mobiles are determined by using the new intercell traffic prediction algorithm. Further, the cells are partitioned into LAs by applying the new traffic-based cell grouping algorithm where the cell pairs with higher intercell mobile traffic are grouped into the same LA. Hence, the inter-LA mobile traffic is decreased by increasing the intra-LA mobile traffic. Experimental results show that this cell grouping algorithm reduces the number of location updates by 27 percent to 36 percent on average compared to proximity-based cell grouping schemes.     

A survey on sensor networks

The advancement in wireless communications and electronics has enabled the development of low-cost sensor networks. The sensor networks can be used for various application areas (e.g., health, military, home). For different application areas, there are different technical issues that researchers are currently resolving. The current state of the art of sensor networks is captured in this article, where solutions are discussed under their related protocol stack layer sections. This article also points out the open research issues and intends to spark new interests and developments in this field.     

Data aggregation and dilution by modulus addressing in wireless sensor networks

DADMA is a distributed data aggregation and dilution technique for sensor networks where nodes aggregate/dilute sensed data by following the rules given in an SQL statement. Our test results show that DADMA reduces the number of transmitted packets 60% on the average.