scholarly journals End-To-End Delay Optimization in Wireless Sensor Network (WSN)

2012 ◽  
pp. 247-251
Author(s):  
Shweta K. Kanhere ◽  
Mahesh Goudar ◽  
Vijay M. Wadhai
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Relay Node ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Packet Forwarding ◽  
Central System ◽  
Neighboring Node ◽  
Packet Delivery ◽  
End To End

In this paper, we are interested in optimizing the delay of event-driven wireless sensor networks, for which events does not occur frequently. In such systems, most of the energy is consumed when the radios are on, waiting for an arrival to occur. Sleep-wake scheduling is an effective mechanism to prolong the lifetime of this energy constrained wireless sensor networks by optimization of the delay in the network but this scheme could result in substantial delays because a transmitting node needs to wait for its next-hop relay node to wake up. An attempt has been made to reduce these delays by developing new method of packet forwarding schemes, where each nod opportunistically forwards a packet to the its neighboring node that wakes up among multiple candidate nodes. In this paper, the focus is to study how to optimize the packet forwarding schemes by optimization of the expected packet-delivery delays from the sensor nodes to the sink. Based on optimized delay scheme result, we then provide a solution to the central system about how to optimally control the system parameters of the sleep-wake scheduling protocol and the packet forwarding protocol to maximize the network lifetime, subject to a constraint on the expected end-to-end packet delivery delay. Our numerical results indicate that the proposed solution can outperform prior heuristic solutions in the literature, especially under the practical scenarios where there are obstructions, e.g., a lake or a mountain, in the area of wireless sensor networks.

A Novel Nature Instilled Moving Sink Architecture for Data Gathering in Wireless Sensor Networks

2020 ◽  
Vol 11 (1) ◽  
pp. 36-48
Author(s):  
Amiya Bhusan Bagjadab ◽  
Sushree Bibhuprada B. Priyadarshini
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Gathering ◽  
Mobile Sink ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Packet Forwarding ◽  
Battery Power ◽  
Communication Distance

Wireless sensor networks are commonly used to monitor certain regions and to collect data for several application domains. Generally, in wireless sensor networks, data are routed in a multi-hop fashion towards a static sink. In this scenario, the nodes closer to the sink become heavily involved in packet forwarding, and their battery power is exhausted rapidly. This article proposes that a special node (i.e., mobile sink) will move in the specified region and collect the data from the sensors and transmit it to the base station such that the communication distance of the sensors will be reduced. The aim is to provide a track for the sink such that it covers maximum sensor nodes. Here, the authors compared two tracks theoretically and in the future will try to simulate the two tracks for the sink movement so as to identify the better one.

scholarly journals Delay and Lifetime Issues for Wireless Sensor Networks

2019 ◽  
Vol 8 (6S4) ◽  
pp. 1199-1203
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Joint Control ◽  
Sink Node ◽  
Neighboring Node ◽  
Main Factors ◽  
Event Based

The network delay and power consumptions are the two main factors governing the efficiency of wireless sensor networks. In this paper, our goal is to minimize the delay and maximize the lifespan of event-based wireless sensor networks in which activities occur infrequently.In such architectures, most of the power is fed on when the radios are on, ready for a packet to arrive.Sleep–wake scheduling is a highly efficient mechanism to prolong the lifetime of these power-constrained wireless sensor networks. However, sleep–wake scheduling could provide result with considerable delays. This research attempts to limit these delays by developing “anycast” based packet forwarding schemes that places each node opportunistically forwards a packet to the first neighboring node which wakes up amongst more than one candidate nodes.In this paper, we propose to optimize the anycast forwarding schemes by minimizing the anticipated packetdelivery delays from the sensor nodes to the sink node. Based on this analysis, we then provide a solution to the joint control problem of how to optimally manage the architecture parameters of the sleep–wake scheduling protocol and the any-cast packetforwarding protocol to maximize the network lifetime, with reference to a constraint on the expected end-to-end packetarriving delay.

scholarly journals End to End Delay and Energy Consumption in a Two Tier Cluster Hierarchical Wireless Sensor Networks

Information ◽  
2019 ◽  
Vol 10 (4) ◽  
pp. 135 ◽  
Author(s):  
Vicente Casares-Giner ◽  
Tatiana Inés Navas ◽  
Dolly Smith Flórez ◽  
Tito R. Vargas H.
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Radial Distance ◽  
Energy Performance ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Data Packets ◽  
Transfer Delay ◽  
End To End

In this work it is considered a circular Wireless Sensor Networks (WSN) in a planar structure with uniform distribution of the sensors and with a two-level hierarchical topology. At the lower level, a cluster configuration is adopted in which the sensed information is transferred from sensor nodes to a cluster head (CH) using a random access protocol (RAP). At CH level, CHs transfer information, hop-by-hop, ring-by-ring, towards to the sink located at the center of the sensed area using TDMA as MAC protocol. A Markovian model to evaluate the end-to-end (E2E) transfer delay is formulated. In addition to other results such as the well know energy hole problem, the model reveals that for a given radial distance between the CH and the sink, the transfer delay depends on the angular orientation between them. For instance, when two rings of CHs are deployed in the WSN area, the E2E delay of data packets generated at ring 2 and at the “west” side of the sink, is 20% higher than the corresponding E2E delay of data packets generated at ring 2 and at the “east” side of the sink. This asymmetry can be alleviated by rotating from time to time the allocation of temporary slots to CHs in the TDMA communication. Also, the energy consumption is evaluated and the numerical results show that for a WSN with a small coverage area, say a radio of 100 m, the energy saving is more significant when a small number of rings are deployed, perhaps none (a single cluster in which the sink acts as a CH). Conversely, topologies with a large number of rings, say 4 or 5, offer a better energy performance when the service WSN covers a large area, say radial distances greater than 400 m.

scholarly journals Improved Cooperation in Underwater Wireless Sensor Networks

2019 ◽  
Vol 38 (4) ◽  
pp. 1009-1020
Author(s):  
Muhammad Shahzaib Sana ◽  
Muhammad Yousaf Ali Khan ◽  
Nasir Saleem ◽  
Imran Ullah Khan ◽  
Arbab Waheed Ahmed
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Average Energy ◽  
Relay Node ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Underwater Wireless Sensor Networks ◽  
Time Data ◽  
Decode And Forward

The WSNs (Wireless Sensor Networks) lead to great opportunities to explore it scientifically. In this network different numbers of SN (Sensor Nodes) are deployed in a specific area to gather information. The UWSNs (Underwater Wireless Sensor Networks) is a highly distributed network of sensor nodes deployed underwater to gather environmental information. Hence, acquirement of real-time data at enhanced data rate and to reduce power consumption is a key concern while designing routing protocol for UWSNs. In this paper, a cooperation based solution is suggested. The solution proposed here uses the DF (Decode and Forward) strategy for relying the information from the source to the destination using a relay node. The signals coming towards the destination are weighted and combined on the basis of their SNRC (Signal to Noise Ratio Combing). The simulation results verify enhancement in different factors, required for evaluation of a UWSN. After implementation of the proposed solution the stability of the network is increased which maximize the PDR (Packet Delivery Ratio). In our proposed solution the transmission is based on channel estimation, an estimate is made for higher reliable channel, which reduces retransmission of packets. Hence, sink receive the packets with lesser delay and as a result E2E (End-to-End) delay is decreased. Data is forwarded using data forwarding by neighbor nodes. It improves average energy consumption of the system. Hence the overall performance and lifetime of a UWSN is increased.

scholarly journals Diverse Congestion Control Schemes for Wireless Sensor Networks

2021 ◽  
Vol 12 (6) ◽  
pp. 2380-2389
Author(s):  
Amit Grover Et al.
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Base Station ◽  
Extensive Study ◽  
Performance Comparison ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Control Schemes

Wireless Sensor Networks (WSNs) comprised of battery operated sensor nodes that collect data from their neighbor nodes and transmit the aggregated information to the sink node or the Base Station (BS). This may result in congestion near the BS and leads to a bottleneck situation in the network. In this paper, an extensive study of earlier reported diverse congestion techniques explicitly diverse Algorithm based - and Layer based-congestion techniques is carried out. Accordingly, a recommendation is drawn based upon their performance comparison. Furthermore, a demonstration is carried out for contemporary earlier reported strategies such as Pro-AODV, CC-AODV, EDAPR, ED-AODV and PCC-AODV by evaluating delay, packet delivery ratio (PDR) and packet loss ratio (PLR). Accordingly, a recommended congestion strategy is suggested depending upon the comparison of the demonstrated schemes.

scholarly journals Implementation of ITREE-MAC Protocol for Effective Power Management and Time Synchronization in Wireless Sensor Networks

2019 ◽  
Vol 8 (12) ◽  
pp. 863-868
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Power Management ◽  
Time Synchronization ◽  
Mac Protocol ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Packet Delivery

The advent of wireless sensor networks (WSN) has led in recent revolutionary modifications in electronic and communication systems .Various applications in wireless network needs time synchronization as a basic requirement. Wireless sensor nodes are tiny in size and operated at low energy to record the required physical parameters for low-duty apps. Because nodes have a tiny battery with a lower life span, power management is crucial for long-term working with the sensors. Wireless Sensor Network is a set of sensor nodes used to send and receive data packets from one sensor node to another. This work aims to propose three protocols such as Receiver Centric MAC protocol (RC-MAC), Improved Receiver Centric MAC protocol (IRC-MAC) and Intelligent Traffic and Resource Elastic Energy MAC protocol (ITREE-MAC) for the WSN environment and based on the application. These protocols help in studying the parametric measures such as delay, energy consumption, packet delivery ratio and throughput. The comparative analysis is carried out to select the more efficient protocol for the application of wireless sensor networks. This research work is implemented and simulated by using NS 2.35 Simulator. Based on the simulation results obtained for proposed protocols using the NS2 simulator. The performance of ITREE-MAC protocol shows better results for parameters end to end delay, energy consumption, throughput, packet delivery ratio. So the overall performance of ITREE-MAC protocol is much better than other three IEEE802.11 MAC, RC-MAC and IRC-MAC protocols. As per results obtained, energy consumption is less in ITREE-MAC protocol and save the power in wireless sensor network applications

Energy Efficient Routing Protocol using relay node in Wireless Sensor Networks

2019 ◽  
Vol 09 ◽  
Author(s):  
Gaurav Kumar Nigam ◽  
Chetna Dabas
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Physical Environment ◽  
Cluster Head ◽  
Relay Node ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Network Stability ◽  
Energy Efficient Routing

Background: The demand of Wireless sensor networks have elevated exceedingly by virtue of broad capability of the sensor networks to relate the physical environment. Sensor devices depend on battery capability and are deployed in adverse environments and it becomes extremely difficult to replace. Thus, elaborating the energy of sensor nodes becomes vital. Method: G-LEACH is proposed by introducing competent cluster head replacement strategy and adding a relay node to increase the network stability and node lifetime. Conclusion: Simulation is performed in NS-2. The proposed G-LEACH is examined with existing LEACH and MODLEACH protocols and the simulation results depicts that G-LEACH outperforms the conventional LEACH and MODLEACH and thereby enhancing the lifetime by rotating the CHs and minimizing the energy dissipation.

scholarly journals DIEER: Delay-Intolerant Energy-Efficient Routing with Sink Mobility in Underwater Wireless Sensor Networks

Sensors ◽  
2020 ◽  
Vol 20 (12) ◽  
pp. 3467
Author(s):  
Kamran Latif ◽  
Nadeem Javaid ◽  
Imdad Ullah ◽  
Zeeshan Kaleem ◽  
Zafar Abbas Malik ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Data Dissemination ◽  
Propagation Delay ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Underwater Wireless Sensor Networks ◽  
Energy Efficient Routing ◽  
Packet Delivery

Underwater Wireless Sensor Networks (UWSNs) are an enabling technology for many applications in commercial, military, and scientific domains. In some emergency response applications of UWSN, data dissemination is more important, therefore these applications are handled differently as compared to energy-focused approaches, which is only possible when propagation delay is minimized and packet delivery at surface sinks is assured. Packet delivery underwater is a serious concern because of harsh underwater environments and the dense deployment of nodes, which causes collisions and packet loss. Resultantly, re-transmission causes energy loss and increases end-to-end delay ( D E 2 E ). In this work, we devise a framework for the joint optimization of sink mobility, hold and forward mechanisms, adoptive depth threshold ( d t h ) and data aggregation with pattern matching for reducing nodal propagation delay, maximizing throughput, improving network lifetime, and minimizing energy consumption. To evaluate our technique, we simulate the three-dimensional (3-D) underwater network environment with mobile sink and dense deployments of sensor nodes with varying communication radii. We carry out scalability analysis of the proposed framework in terms of network lifetime, throughput, and packet drop. We also compare our framework to existing techniques, i.e., Mobicast and iAMCTD protocols. We note that adapting varying d t h based on node density in a range of network deployment scenarios results in a reduced number of re-transmissions, good energy conservation, and enhanced throughput. Furthermore, results from extensive simulations show that our proposed framework achieves better performance over existing approaches for real-time delay-intolerant applications.

Sign in / Sign up

Export Citation Format

Share Document