ADAPTIVE DATA DISSEMINATION IN MOBILE SENSOR NETWORKS

2009 ◽  
Vol 10 (04) ◽  
pp. 435-457
Author(s):  
ATHANASIOS KINALIS ◽  
SOTIRIS NIKOLETSEAS
Keyword(s):  
Sensor Networks ◽  
Data Dissemination ◽  
High Mobility ◽  
Cost Effective ◽  
Sensor Nodes ◽  
Inhibition Mechanism ◽  
Delivery Ratio ◽  
Message Delivery ◽  
Network Parameter ◽  
Trade Offs

Motivated by emerging applications, we consider sensor networks where the sensors themselves (not just the sinks) are mobile. Furthermore, we focus on mobility scenarios characterized by heterogeneous, highly changing mobility roles in the network. To capture these high dynamics of diverse sensory motion we propose a novel network parameter, the mobility level, which, although simple and local, quite accurately takes into account both the spatial and speed characteristics of motion. We then propose adaptive data dissemination protocols that use the mobility level estimation to optimize performance, by basically exploiting high mobility (redundant message ferrying) as a cost-effective replacement of flooding, e.g. the sensors tend to dynamically propagate less data in the presence of high mobility, while nodes of high mobility are favored for moving data around. These dissemination schemes are enhanced by a distance-sensitive probabilistic message flooding inhibition mechanism that further reduces communication cost, especially for fast nodes of high mobility level, and as distance to data destination decreases. Our simulation findings demonstrate significant performance gains of our protocols compared to non-adaptive protocols, i.e. adaptation increases the success rate and reduces latency (even by 15%) while at the same time significantly reducing energy dissipation (in most cases by even 40%). Also, our adaptive schemes achieve significantly higher message delivery ratio and satisfactory energy-latency trade-offs when compared to flooding when sensor nodes have limited message queues.

scholarly journals An Energy Efficient Secure Data Aggregation in Wireless Sensor Networks

2021 ◽  
Author(s):  
Jenice Prabu A ◽  
Hevin Rajesh D
Keyword(s):  
Energy Consumption ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Data Communication ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Malicious Nodes ◽  
Aggregated Data

Abstract In Wireless sensor network, the major issues are security and energy consumption. There may be several numbers of malicious nodes present in sensor networks. Several techniques have been proposed by the researchers to identify these malicious nodes. WSNs contain many sensor nodes that sense their environment and also transmit their data via multi-hop communication schemes to the base station. These sensor nodes provides power supply using battery and the energy consumption of these batteries must be low. Securing the data is to avoid attacks on these nodes and data communication. The aggregation of data helps to minimize the amount of messages transmitted within the network and thus reduces overall network energy consumption. Moreover, the base station may distinguish the encrypted and aggregated data based on the encryption keys during the decryption of the aggregated data. In this paper, two aspects of the problem is concerned, we investigate the efficiency of data aggregation: first, how to develop cluster-based routing algorithms to achieve the lowest energy consumption for aggregating data, and second, security issues in wsn. By using Network simulator2 (NS2) this scheme is simulated. In the proposed scheme, energy consumption, packet delivery ratio and throughput is analyzed. The proposed clustering, routing, and protection protocol based on the MCSDA algorithm shows significant improvement over the state-of - the-art protocol.

scholarly journals APSSR: Adaptive Packet Size Selection Based Routing Protocol for Underwater Acoustic Sensor Networks

2021 ◽  
Vol 10 (3) ◽  
pp. 2313-2323
Keyword(s):  
Sensor Networks ◽  
Routing Protocol ◽  
Sensor Nodes ◽  
Delivery Ratio ◽  
Data Delivery ◽  
Acoustic Sensor ◽  
Packet Size ◽  
Underwater Acoustic Sensor Networks ◽  
Acoustic Sensor Networks ◽  
Selection Of

Underwater Acoustic Sensor Networks offer very promising solutions to monitor the aqueous environments. Due to the distinctive characteristics of UASNs, it is very challenging to design a routing protocol that can achieve maximum data delivery ratio in the network. The main challenge is the communication medium (acoustic links) that is subject to temporary attenuation and high bit error rate (BER), which limits the throughput efficiency of the Network. Besides this, another major issue is the continuous movement of nodes due to water currents and the availability of limited resources. Due to nodes mobility distance among sensor nodes and consequently, BER varies, which have a direct impact on packet size, hence, leads to high packet loss and low data delivery ratio. To achieve a high data delivery ratio, the selection of optimal packet size is of utmost importance. Consequently, the selection of next-hop forwarding node based on optimal packet size is needed. Therefore, in this paper, we propose an adaptive routing protocol named Adaptive Packet Size Selection Based Routing (APSSR) Protocol for UASNs. APSSR determines the optimal packet size adaptively based on both varying distances between sensor nodes and BER and selects the next hop based on optimal packet size and BER. The simulation results show greater network performance in terms of Network Lifetime, Data Reception Ratio at Sink node, Average Network Delay, Packet Reception Ratio, and Packets Drop Ratio

Multicast Scaling in Heterogeneous Wireless Sensor Networks for Security and Time Efficiency

2021 ◽  
Author(s):  
Ramdas Vankdothu ◽  
Hameed Mohd Abdul ◽  
Fatima Husnah ◽  
Subbarao Akkala
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Performance ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Time Efficiency ◽  
Efficiency Measures ◽  
Heterogeneous Wireless Sensor Networks ◽  
Fuzzy C Means Clustering

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.

Novel Energy Aware Algorithm to Design Multilayer Architecture for Dense Wireless Sensor Networks

2016 ◽  
pp. 79-114
Author(s):  
Naveen Chilamkurti ◽  
Sohail Jabbar ◽  
Abid Ali Minhas
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Architecture ◽  
Network Performance ◽  
Data Dissemination ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Unbalanced Load

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.

Novel Energy Aware Algorithm to Design Multilayer Architecture for Dense Wireless Sensor Networks

2020 ◽  
pp. 372-399
Author(s):  
Naveen Chilamkurti ◽  
Sohail Jabbar ◽  
Abid Ali Minhas
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Architecture ◽  
Network Performance ◽  
Data Dissemination ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Unbalanced Load

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.

scholarly journals Robust Evolutionary-Game-Based Routing for Wireless Multimedia Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (16) ◽  
pp. 3544 ◽  
Author(s):  
Md Arafat Habib ◽  
Sangman Moh
Keyword(s):  
Energy Efficiency ◽  
Sensor Networks ◽  
Evolutionary Game ◽  
Wireless Multimedia Sensor Networks ◽  
Multimedia Data ◽  
Sensor Nodes ◽  
Delivery Ratio ◽  
Wireless Multimedia ◽  
Multimedia Sensor Networks ◽  
Multiple Sinks

Nowadays, wireless multimedia sensor networks (WMSNs) are used in various applications. An energy-efficient and robust routing protocol is essential for WMSNs because the quality of service is important for traffic-intensive multimedia data, such as images and videos. A WMSN with multiple sinks allows cluster heads (CHs) to deliver the collected data to the nearest sink, thereby mitigating the delivery overhead. In this study, we propose a novel evolutionary-game-based routing (EGR) protocol for WMSNs with multiple sinks, in which the evolutionary game theory is exploited for selecting CHs. In EGR, an algorithm to mitigate data redundancy, based on the overlapping field of views of the multimedia sensor nodes, is also presented. This algorithm decreases the number of redundant transmissions, thereby increasing energy efficiency and network performance. According to the performance evaluation results of this study, the proposed EGR significantly outperforms the state-of-art protocols in terms of energy efficiency, end-to-end delay, packet delivery ratio, cluster formation time, and network lifetime.

scholarly journals Probability Model for Data Redundancy Detection in Sensor Networks

2009 ◽  
Vol 5 (2) ◽  
pp. 195-204 ◽  
Author(s):  
Suman Kumar ◽  
Seung-Jong Park
Keyword(s):  
Sensor Networks ◽  
Data Dissemination ◽  
Probability Model ◽  
Poisson Processes ◽  
Sensor Nodes ◽  
Data Redundancy ◽  
Share Data ◽  
Degree Of Confidence ◽  
Redundancy Detection ◽  
Bivariate Poisson Process

Sensor networks are made of autonomous devices that are able to collect, store, process and share data with other devices. Large sensor networks are often redundant in the sense that the measurements of some nodes can be substituted by other nodes with a certain degree of confidence. This spatial correlation results in wastage of link bandwidth and energy. In this paper, a model for two associated Poisson processes, through which sensors are distributed in a plane, is derived. A probability condition is established for data redundancy among closely located sensor nodes. The model generates a spatial bivariate Poisson process whose parameters depend on the parameters of the two individual Poisson processes and on the distance between the associated points. The proposed model helps in building efficient algorithms for data dissemination in the sensor network. A numerical example is provided investigating the advantage of this model.

scholarly journals BiPAD: Binomial Point Process Based Energy-Aware Data Dissemination in Opportunistic D2D Networks

Energies ◽  
2018 ◽  
Vol 11 (8) ◽  
pp. 2073
Author(s):  
Seho Han ◽  
Kisong Lee ◽  
Hyun-Ho Choi ◽  
Howon Lee
Keyword(s):  
Point Process ◽  
Routing Protocol ◽  
Data Dissemination ◽  
Optimal Number ◽  
Delivery Ratio ◽  
Message Delivery ◽  
Energy Aware ◽  
Epidemic Routing ◽  
Efficient Data ◽  
Binomial Point Process

In opportunistic device-to-device (D2D) networks, the epidemic routing protocol can be used to optimize the message delivery ratio. However, it has the disadvantage that it causes excessive coverage overlaps and wastes energy in message transmissions because devices are more likely to receive duplicates from neighbors. We therefore propose an efficient data dissemination algorithm that can reduce undesired transmission overlap with little performance degradation in the message delivery ratio. The proposed algorithm allows devices further away than the k-th furthest distance from the source device to forward a message to their neighbors. These relay devices are determined by analysis based on a binomial point process (BPP). Using a set of intensive simulations, we present the resulting network performances with respect to the total number of received messages, the forwarding efficiency and the actual number of relays. In particular, we find the optimal number of relays to achieve almost the same message delivery ratio as the epidemic routing protocol for a given network deployment. Furthermore, the proposed algorithm can achieve almost the same message delivery ratio as the epidemic routing protocol while improving the forwarding efficiency by over 103% when k≥10.

MONet

2017 ◽  
Vol 13 (4) ◽  
pp. 345-369
Author(s):  
Kamel Barka ◽  
Azeddine Bilami ◽  
Samir Gourdache
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Power Efficiency ◽  
Sensor Nodes ◽  
Sensor Data ◽  
Wireless Sensor ◽  
Multi Objective Optimization ◽  
Content Type ◽  
Multi Objective ◽  
Trade Offs

Purpose The purpose of this paper is to ensure power efficiency in wireless sensor networks (WSNs) through a new framework-oriented middleware, based on a biologically inspired mechanism that uses an evolutionary multi-objective optimization algorithm. The authors call this middleware framework multi-objective optimization for wireless sensor networks (MONet). Design/methodology/approach In MONet, the middleware level of each network node autonomously adjusts its routing parameters according to dynamic network conditions and seeks optimal trade-offs among performance objectives for a balance of its global performance. MONet controls the cooperation between agents (network nodes) while varying transmission paths to reduce and distribute power consumption equitably on all the sensor nodes of network. MONet-runtime uses a modified TinyDDS middleware platform. Findings Simulation results confirm that MONet allows power efficiency to WSN nodes while adapting their sleep periods and self-heal false-positive sensor data. Originality/value The framework implementation is lightweight and efficient enough to run on resource-limited nodes such as sensor nodes.

scholarly journals A Multi Route Rank Based Routing Protocol for Industrial Wireless Mesh Sensor Networks

2016 ◽  
Vol 16 (4) ◽  
pp. 73-86 ◽  
Author(s):  
V. Sarasvathi ◽  
N.Ch.S.N. Iyengar
Keyword(s):  
Sensor Networks ◽  
Heavy Traffic ◽  
Packet Delay ◽  
Sensor Nodes ◽  
Harsh Environments ◽  
Delivery Ratio ◽  
Hop Count ◽  
Traffic Condition ◽  
Packet Delivery ◽  
Wireless Mesh

Abstract Wireless Mesh Sensor nodes are deployed in harsh environments, like Industrial Wireless Mesh Sensor Networks (IWMSN). There the equipment is exposed to temperature and electrical noise, so providingareliable, interference free and efficient communication in this environment isachallenge. We proposea Multi Route Rank based Routing (MR3) protocol, which enhances the link dynamics for IWMSNand also provides interference free reliable packet delivery in harsh environments. The rank ofanode is estimated based on density, hop count, energy and Signal to Interference plus Noise Ratio (SINR). The route discovery phase finds the rank value to forward the data packet inareliable path. Once the forwarding path is established, subsequently the data packets can be propagated towards the destination without using any location information. Our simulation results show that this method improves the packet delivery ratio and the throughput tremendously, and at the same time minimizes the packet delay, in heavy traffic condition.

Sign in / Sign up

Export Citation Format

Share Document