scholarly journals A Data-Gathering, Dynamic Duty-Cycling MAC Protocol for Large-Scale Wireless Sensor Networks

Sensors ◽  
2020 ◽  
Vol 20 (15) ◽  
pp. 4071
Author(s):  
Fei Tong ◽  
Yuyang Peng

This paper presents a Data-gathering, Dynamic Duty-cycling (D3) protocol for wireless sensor networks. With a proposed duty-cycling MAC of high energy efficiency in D3, a routing scheme is naturally embedded to reduce protocol overhead. A packet can be forwarded in a pipelined fashion by staggering the sleep-wakeup schedules between two communicating nodes, which can significantly reduce end-to-end delay to meet real-time transmission requirements. To construct and maintain schedules, a grade and schedule establishment mechanism with a lightweight schedule error correction scheme is designed. In addition, based on the intrinsic characteristics of the network, an adaptive schedule maintenance scheme is proposed to dynamically adjust the node duty cycle to the network traffic load. The results based on the extensive OPNET simulations show that D3 can largely improve packet delivery ratio, energy efficiency and throughput, and reduce packet delivery latency.

Sensors ◽  
2020 ◽  
Vol 20 (19) ◽  
pp. 5608
Author(s):  
Quanwei Zhang ◽  
Dazhong Li ◽  
Yue Fei ◽  
Jiakang Zhang ◽  
Yu Chen ◽  
...  

Existing duty-cycling and pipelined-forwarding (DCPF) protocols applied in battery-powered wireless sensor networks can significantly alleviate the sleep latency issue and save the energy of networks. However, when a DCPF protocol applies to a linear sensor network (LSN), it lacks the ability to handle the bottleneck issue called the energy-hole problem, which is mainly manifested due to the excessive energy consumption of nodes near the sink node. Without overcoming this issue, the lifespan of the network could be greatly reduced. To that end, this paper proposes a method of deploying redundant nodes in LSN, and a corresponding enhanced DCPF protocol called redundancy-based DCPF (RDCPF) to support the new topology of LSN. In RDCPF, the distribution of energy consumption of the whole network becomes much more even. RDCPF also brings improvements to the network in terms of network survival time, packet delivery latency, and energy efficiency, which have been shown through the extensive simulations in comparison with existing DCPF protocols.


2021 ◽  
Vol 6 (9 (114)) ◽  
pp. 6-14
Author(s):  
Shaymaa Kadhim Mohsin ◽  
Maysoon A. Mohammed ◽  
Helaa Mohammed Yassien

Bluetooth uses 2.4 GHz in ISM (industrial, scientific, and medical) band, which it shares with other wireless operating system technologies like ZigBee and WLAN. The Bluetooth core design comprises a low-energy version of a low-rate wireless personal area network and supports point-to-point or point-to-multipoint connections. The aim of the study is to develop a Bluetooth mesh flooding and to estimate packet delivery ratio in wireless sensor networks to model asynchronous transmissions including a visual representation of a mesh network, node-related statistics, and a packet delivery ratio (PDR). This work provides a platform for Bluetooth networking by analyzing the flooding of the network layers and configuring the architecture of a multi-node Bluetooth mesh. Five simulation scenarios have been presented to evaluate the network flooding performance. These scenarios have been performed over an area of 200×200 meters including 81 randomly distributed nodes including different Relay/End node configurations and source-destination linking between nodes. The results indicate that the proposed approach can create a pathway between the source node and destination node within a mesh network of randomly distributed End and Relay nodes using MATLAB environment. The results include probability calculation of getting a linking between two nodes based on Monte Carlo method, which was 88.7428 %, while the Average-hop-count linking between these nodes was 8. Based on the conducted survey, this is the first study to examine and demonstrate Bluetooth mesh flooding and estimate packet delivery ratio in wireless sensor networks


2019 ◽  
Vol 2019 ◽  
pp. 1-19
Author(s):  
Hyeonsang Cho ◽  
Jungmin So

In this paper, we propose a data dissemination protocol for asynchronous duty-cycling wireless sensor networks. In an asynchronous duty-cycling network, each node independently selects its wake-up time. In this environment, data dissemination becomes energy consuming, because broadcasting a packet does reach all neighbors but only the neighbors that are awake at the time. A node can forward its packet to all neighbors by continuously transmitting the packet for a whole wake-up interval, but it leads to high energy consumption and high dissemination delay. The idea proposed in this paper is to use opportunistic forwarding, where each node forwards the packet to a neighbor that wakes up early and receives the packet. Each node forwards the packet, as long as there is a neighboring node that has not received the packet yet. The main benefit of this opportunistic forwarding-based dissemination is that every time a packet is disseminated, it may take a different path to reach the nodes. At the beginning of dissemination, a sender needs to transmit for a very short duration of time because there are plenty of neighboring nodes to receive the packet. As more nodes receive the packet, the transmit duration of the sender becomes longer, thus consuming more energy. Since the order of dissemination is different every time, energy consumption is naturally balanced among the nodes, without explicit measures. Through extensive simulations, we show that the proposed protocol achieves longer network lifetime and shorter dissemination delay compared to other dissemination protocols in various network environments.


2012 ◽  
Vol 268-270 ◽  
pp. 1910-1915
Author(s):  
Yan Chen ◽  
Wen Kang Wu ◽  
Liang Li

In three-dimensional wireless sensor networks, a topology with higher node degrees usually has many routes that consume less energy, but it increases the traffic load of the whole network. Therefore, the trade-off is between the node degree and the energy efficiency. In view of this question, this paper presents the definition and property of 3D r-neighbourhood graph, and uses the graph to balance the node degree and the energy efficiency of the whole network. This algorithm named NGTC, and it can adjust the structure of the networks to be a perfect state. Finally, the simulation results prove the advantage of this algorithm.


Author(s):  
Kavitha Ganesh ◽  
P. Latchoumy ◽  
A. Sonya

<span>Heterogeneous Wireless Sensor Networks (HWSN) gathers information from a cooperative network. In HWSN, the sensor nodes are scattered and the major challenges are topology control, battery optimization, packet loss and link lifetime. The existing techniques do not concentrate on all the mentioned issues. The objective of this work is to provide congestion-free data transfer with higher throughput and increased packet delivery ratio. In the proposed methodology, three protocols are designed and developed, namely, Hop by Hop Rate Adjustment Protocol (HHRA), Energy Efficient Data Transfer Protocol (EEDT) and Alternative Routing Congestion Control Protocol (ARCC). The HHRA protocol senses the traffic in the channel and adjusts the transmission rate accordingly to avoid congestion. Secondly, the EEDT protocol is used to find specific nodes that are more efficient and transfer packets through those nodes to improve throughput. The ARCC protocol is used to redirect the path of transmission during the occurrence of congestion. Thus, the proposed traffic contention and control mechanisms ensures congestion free transmission and increases the packet delivery ratio by 23% and average throughput by 20% compared to the Dynamic Contention Window based Congestion Control (DCWCC) algorithm. </span>


Author(s):  
Sachin Lalar ◽  
. Monika ◽  
Arun Kumar Yadav

Wireless sensor networks (WSNs) establish a new popular of ambient supervision with many latent packages. The environment of wireless sensor networks prone to different forms of attacks as networks are prepared in open and unsecured surroundings. This paper analyses the overall performance of AODV whilst attacked by black hole, through varying the mobility of the nodes within the community. The overall performance metrics which can be used to do the analysis are LPR, packet delivery ratio & Packet loss. The simulation consequences display that the overall performance of each AODV degrades in the presence of black hole attack.


Wireless Sensor Networks are in rapid advance occupying every field of our lives. They are in great demand and are widely used in transmission of data like temperature, pressure, humidity, speed etc. As these networks are wireless and are easily prone to intrusion by the attackers. Hence the basic concern is security of data. The nodes in the network will be sending information between the nodes, and in between the nodes intrusion takes place with attack like wormhole attack, black hole attack, sybil attack, hello flood attack etc. which corrupts data. These attacks effect the efficiency of the network and the parameters like packet delivery ratio and throughput of the network is affected. Black hole is a severe attack in network which alters most of the data before it is received at the sink, hence has to be detected and prevented. In this paper, Adhoc on demand distance vector (AODV) protocol is used to detect and prevent the black hole attack using Network Simulator (NS-2.3)


Sign in / Sign up

Export Citation Format

Share Document