Techniques for Exploiting Mobility in Wireless Sensor Networks

Author(s):  
Ataul Bari ◽  
Arunita Jaekel

A sensor network consists of tiny, low-powered and multifunctional sensor devices and is able to perform complex tasks through the collaborative efforts of a large number of sensor nodes that are densely deployed within the sensing field. Maintaining connectivity and maximizing the network lifetime are among the critical considerations in designing sensor networks and its protocols. Conservation of limited energy reserves at each sensor node is one of the greatest challenges in a sensor network. It has been suggested that mobility of some nodes/entities in a sensor network can be exploited to improve network performance in a number of areas, including coverage, lifetime, connectivityy, and fault-tolerance. In this context, techniques for effectively utilizing the unique capabilities of mobile nodes have been attracting increasing research attention in the past few years. In this chapter, the authors focus on some of the new and innovative techniques that have been recently proposed to handle a number of important problems in this field. It also presents a number of open problems and some developing trends and directions for future work in this emerging research area.

Author(s):  
Priyanka Jain

Abstract: The area of underwater wireless sensor networks (UWSNs) is garnering an increasing attention from researchers due to its broad potential for exploring and harnessing oceanic sources of interest. Because of the need for real-time remote data monitoring, underwater acoustic sensor networks (UASNs) have become a popular choice. The restricted availability and nonrechargeability of energy resources, as well as the relative inaccessibility of deployed sensor nodes for energy replenishment, forced the development of many energy optimization approaches un the UASN. Clustering is an example of a technology that improves system scalability while also lowering energy consumption. Due to the unstable underwater environment, coverage and connectivity are two important features that determine the proper detection and communication of events of interest in UWSN. A sensor network consists of several nodes that are low in cost and have a battery with low capacity. In wireless sensor networks, knowing the position of a specific device in the network is a critical challenge. Many wireless systems require location information from mobile nodes. Keywords: MAC, Communication cost, IDV-Hop algorithm, Localization, Ranging error, unconstrained optimization, Wireless sensor network, Distributed Least Square


2017 ◽  
Vol 16 (5) ◽  
pp. 6926-6932
Author(s):  
Chamanpreet Kaur ◽  
Vikramjit Singh

Wireless sensor networks have become increasingly popular due to their wide range of application. Clustering sensor nodes organizing them hierarchically have proven to be an effective method to provide better data aggregation and scalability for the sensor network while conserving limited energy. Minimizing the energy consumption of a wireless sensor network application is crucial for effective realization of the intended application in terms of cost, lifetime, and functionality. However, the minimizing task is hardly possible as no overall energy cost function is available for optimization. The need for energy-efficient infrastructures for sensor networks is becoming increasingly important. Wireless sensor networks are networks consisting of many sensor nodes that communicate over a wireless media. A sensor node is equipped with a sensor module, a processor, a radio module and a battery. Since the battery limits the lifetime of the sensor nodes it also limits the lifetime of the sensor network, thus energy efficiency is a major issue for sensor networks. An important goal in many sensor networks is to monitor an area as long time as possible. Hence, it is important to distribute energy consumption evenly across the network. When the energy consumption is evenly distributed, the major part of the sensor nodes will stay alive approximately equally long time.


Author(s):  
Rekha Goyat ◽  
Mritunjay Kumar Rai ◽  
Gulshan Kumar ◽  
Hye-Jin Kim ◽  
Se-Jung Lim

Background: Wireless Sensor Networks (WSNs) is considered one of the key research area in the recent. Various applications of WSNs need geographic location of the sensor nodes. Objective: Localization in WSNs plays an important role because without knowledge of sensor nodes location the information is useless. Finding the accurate location is very crucial in Wireless Sensor Networks. The efficiency of any localization approach is decided on the basis of accuracy and localization error. In range-free localization approaches, the location of unknown nodes are computed by collecting the information such as minimum hop count, hop size information from neighbors nodes. Methods: Although various studied have been done for computing the location of nodes but still, it is an enduring research area. To mitigate the problems of existing algorithms, a range-free Improved Weighted Novel DV-Hop localization algorithm is proposed. Main motive of the proposed study is to reduced localization error with least energy consumption. Firstly, the location information of anchor nodes is broadcasted upto M hop to decrease the energy consumption. Further, a weight factor and correction factor are introduced which refine the hop size of anchor nodes. Results: The refined hop size is further utilized for localization to reduces localization error significantly. The simulation results of the proposed algorithm are compared with other existing algorithms for evaluating the effectiveness and the performance. The simulated results are evaluated in terms localization error and computational cost by considering different parameters such as node density, percentage of anchor nodes, transmission range, effect of sensing field and effect of M on localization error. Further statistical analysis is performed on simulated results to prove the validation of proposed algorithm. A paired T-test is applied on localization error and localization time. The results of T-test depicts that the proposed algorithm significantly improves the localization accuracy with least energy consumption as compared to other existing algorithms like DV-Hop, IWCDV-Hop, and IDV-Hop. Conclusion: From the simulated results, it is concluded that the proposed algorithm offers 36% accurate localization than traditional DV-Hop and 21 % than IDV-Hop and 13% than IWCDV-Hop.


2014 ◽  
Vol 701-702 ◽  
pp. 1025-1028
Author(s):  
Yu Zhu Liang ◽  
Meng Jiao Wang ◽  
Yong Zhen Li

Clustering the sensor nodes and choosing the way for routing the data are two key elements that would affect the performance of a wireless sensor network (WSN). In this paper, a novel clustering method is proposed and a simple two-hop routing model is adopted for optimizing the network layer of the WSN. New protocol is characterized by simplicity and efficiency (SE). During the clustering stage, no information needs to be shared among the nodes and the position information is not required. Through adjustment of two parameters in SE, the network on any scale (varies from the area and the number of nodes) could obtain decent performance. This work also puts forward a new standard for the evaluation of the network performance—the uniformity of the nodes' death—which is a complement to merely taking the system lifetime into consideration. The combination of these two aspects provides a more comprehensive guideline for designing the clustering or routing protocols in WSN.


Information ◽  
2018 ◽  
Vol 9 (9) ◽  
pp. 236 ◽  
Author(s):  
Nengsong Peng ◽  
Weiwei Zhang ◽  
Hongfei Ling ◽  
Yuzhao Zhang ◽  
Lixin Zheng

A key issue in wireless sensor network applications is how to accurately detect anomalies in an unstable environment and determine whether an event has occurred. This instability includes the harsh environment, node energy insufficiency, hardware and software breakdown, etc. In this paper, a fault-tolerant anomaly detection method (FTAD) is proposed based on the spatial-temporal correlation of sensor networks. This method divides the sensor network into a fault neighborhood, event and fault mixed neighborhood, event boundary neighborhood and other regions for anomaly detection, respectively, to achieve fault tolerance. The results of experiment show that under the condition that 45% of sensor nodes are failing, the hit rate of event detection remains at about 97% and the false negative rate of events is above 92%.


Author(s):  
Hoang Dang Hai ◽  
Thorsten Strufe ◽  
Pham Thieu Nga ◽  
Hoang Hong Ngoc ◽  
Nguyen Anh Son ◽  
...  

Sparse  Wireless  Sensor  Networks  using several  mobile  nodes  and  a  small  number  of  static sensor  nodes  have  been  widely  used  for  many applications,  especially  for  traffic-generated  pollution monitoring.  This  paper  proposes  a  method  for  data collection and forwarding using Mobile Elements (MEs), which are moving on predefined trajectories in contrast to previous works that use a mixture of MEsand static nodes. In our method, MEscan be used as data collector as well as dynamic bridges for data transfer. We design the  trajectories  in  such  a  way,  that  they  completely cover  the  deployed  area  and  data  will  be  gradually forwarded  from  outermost  trajectories  to  the  center whenever  a  pair  of MEs contacts  each  other  on  an overlapping road distance of respective trajectories. The method  is based  on  direction-oriented  level  and  weight assignment.  We  analyze  the  contact  opportunity  for data  exchange  while MEs move.  The  method  has  been successfully tested for traffic pollution monitoring in an urban area.


2015 ◽  
Vol 2015 ◽  
pp. 1-8 ◽  
Author(s):  
Ahmad S. Almogren

With recent advances in wireless sensor networks and embedded computing technologies, body sensor networks (BSNs) have become practically feasible. BSNs consist of a number of sensor nodes located and deployed over the human body. These sensors continuously gather vital sign data of the body area to be used in various intelligent systems in smart environments. This paper presents an intelligent design of the body sensor network based on virtual hypercube structure backbone termed as Smart BodyNet. The main purpose of the Smart BodyNet is to provide resilience for the BSN operation and reduce power consumption. Various experiments were carried out to show the performance of the Smart BodyNet design as compared to the state-of-the-art approaches.


The emergence of sensor networks as one of the dominant technology trends in the coming decades has posed numerous unique challenges on their security to researchers. These networks are likely to be composed of thousands of tiny sensor nodes, which are low-cost devices equipped with limited memory, processing, radio, and in many cases, without access to renewable energy resources. While the set of challenges in sensor networks are diverse, we focus on security of Wireless Sensor Network in this paper. First, we propose some of the security goal for Wireless Sensor Network. To perform any task in WSN, the goal is to ensure the best possible utilization of sensor resources so that the network could be kept functional as long as possible. In contrast to this crucial objective of sensor network management, a Denial of Service (DoS) attack targets to degrade the efficient use of network resources and disrupts the essential services in the network. DoS attack could be considered as one of th


2021 ◽  
Author(s):  
Ramdas Vankdothu ◽  
Hameed Mohd Abdul ◽  
Fatima Husnah ◽  
Subbarao Akkala

Abstract Heterogeneous wireless sensor networks (HWSNs) satisfy researchers' requirements for developing real-world solutions that handle unattended challenges. However, the primary constraint of researchers is the privacy of the sensor nodes. It safeguards the sensor nodes and extensions in the HWSNs. Therefore, it is necessary to develop secure operational systems. Multicast scaling with security and time efficiency is described in heterogeneous wireless sensor networks to maximize network performance while also successfully protecting network privacy. This study evaluates the initial security and time efficiency measures, such as execution time, transmission delay, processing delay, congestion level, and trust measure. Subsequently, the optimal location of the heterogeneous nodes is determined using sigmoid-based fuzzy c-means clustering. Finally, successful cluster routing was achieved via support-value-based particle swarm optimization. The experimental results indicate that the proposed strategy surpasses existing strategies in terms of network delivery ratio, end-to-end delay, throughput, packet delivery, and node remaining energy level.


Author(s):  
Naveen Chilamkurti ◽  
Sohail Jabbar ◽  
Abid Ali Minhas

Network layer functionalists are of core importance in the communication process and so the routing with energy aware trait is indispensable for improved network performance and increased network lifetime. Designing of protocol at this under discussion layer must consider the aforementioned factors especially for energy aware routing process. In wireless sensor networks there may be hundreds or thousands of sensor nodes communicating with each other and with the base station, which consumes more energy in exchanging data and information with the additive issues of unbalanced load and intolerable faults. Two main types of network architectures for sensed data dissemination from source to destination exist in the literature; Flat network architecture, clustered network architecture. In flat architecture based networks, uniformity can be seen since all the network nodes work in a same mode and generally do not have any distinguished role.


Sign in / Sign up

Export Citation Format

Share Document