scholarly journals A Network Coding Based Rarest-First Packet Recovery Algorithm for Transmitting Geocast Packets over Hybrid Sensor-Vehicular Networks

2012 ◽  
Vol 8 (4) ◽  
pp. 954398 ◽  
Author(s):  
Tz-Heng Hsu ◽  
Ying-Chen Lo
Keyword(s):  
Network Coding ◽  
Vehicular Networks ◽  
High Efficiency ◽  
Network Capacity ◽  
Processing Technique ◽  
Mobile Node ◽  
Sensor Nodes ◽  
Driving Safety ◽  
Recovery Algorithm ◽  
Packet Recovery

Vehicular ad hoc network (VANET) and road-side sensors are used to improve driving safety in many applications. Sensor nodes deployed along the roadside are used to sense road conditions and then deliver information about dangerous conditions to vehicles. In hybrid sensor-vehicular networks, new challenges arise and should be addressed. Geocasting can be used to perform the regional broadcast to deliver geographic-related safety, commercials, and advertisements messages. The challenging problem in geocasting is how to deliver packets to all the nodes within the geocast region with high efficiency but low overhead. Network coding is a special in-network data-processing technique that can potentially increase the network capacity and packet throughput in wireless networking environments. In this paper, a network coding based rarest-first packet recovery algorithm for transmitting geocast packets over hybrid sensor-vehicular-networks is proposed. The proposed algorithm can increase packet delivered ratio at each mobile node. As a result, the safety and transmission efficiency can be achieved simultaneously.

scholarly journals An Efficient Nodes Failure Recovery Management Algorithm for Mobile Sensor Networks

2020 ◽  
Vol 2020 ◽  
pp. 1-14
Author(s):  
Rab Nawaz Jadoon ◽  
Adnan Anwar Awan ◽  
Muhammad Amir Khan ◽  
WuYang Zhou ◽  
Aamir Shahzad
Keyword(s):  
Sensor Networks ◽  
Uniform Distribution ◽  
Complete Recovery ◽  
Mobile Node ◽  
Sensor Nodes ◽  
Mobile Sensor ◽  
Intermediate Node ◽  
Recovery Algorithm ◽  
Management Algorithm ◽  
Recovery Management

Wireless sensor networks are not prone to harsh environments and may fail due to various reasons. Failure of sensor nodes causes partitioning of network into various small segments and restricts the communication of nodes. Due to the significant importance of restoration mechanisms, many approaches have been proposed in the literature so far. However, these approaches do not focus on uniform distribution of sensor nodes before the occurrence of failure. This paper fulfills the shortcoming in the literature by proposing a Uniform Distribution and Recovery Algorithm (UDRA) in two parts. The first part (prefailure algorithm) focuses on preparing the mobile sensor nodes to be ready for the failure beforehand by maintaining half of their communication distance between them. Also, it uses a novel method of directional matrix based on one-hop information. By using this method, each mobile node declares itself as cut-vertex (CV), intermediate node, or leaf node. The second part of the algorithm (postfailure algorithm) gives complete recovery procedure in the network by its recovery nodes. The extensive simulations prove that the proposed algorithm supersedes the existing approaches.

scholarly journals An Overview of Data Dissemination in Wireless Sensor Network Using an Instantly Decodeable Network Coding

2019 ◽  
pp. 1-8
Author(s):  
Kadiri Kamoru Oluwatoyin ◽  
Kehinde Olalekan Samson
Keyword(s):  
Network Coding ◽  
Data Dissemination ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Future Research ◽  
Relay Nodes ◽  
Research Areas ◽  
Packet Recovery ◽  
Energy Dissipated ◽  
Alternate Routes

Wireless Sensor Networks (WSNs) are networks of small, cheap, independent battery-powered sensor nodes, finds applications in agriculture, health care, intrusion detection, asset tracking, habitat monitoring and in many other fields. It is sometimes necessary to disseminate data via wireless links after the deployment of sensors so as achieve the objectives of sensors configurations parameters adjustment or distribution of commands management and queries to sensors. The present study considered how Shortest Path Minded Sensor Protocols for Information via Negotiation (SPIN)-Recursive (SPMS-Rec), reduces the energy dissipated in the event of failures by requiring intermediate relay nodes to try alternate routes, is suitable for data dissemination. Despite to the power constraints and memory limitations of sensory nodes, ‘Instantly Decodable Network coding’ (IDNC) was considered because of its practicality, relevance and numerous desirable properties such as instant packet recovery, simple XOR-based packet encoding and decoding, and zero buffer memory to store un-decoded packets. The paper concludes with reference and suggestions of possible future research areas.

scholarly journals DDGS: A Network Coding Scheme for Dynamic Adaptation to Heterogeneous Vehicular Networks

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Zongzheng Wang ◽  
Ping Dong ◽  
Tao Zheng ◽  
Hongke Zhang
Keyword(s):  
Network Coding ◽  
Vehicular Networks ◽  
Rapid Development ◽  
Heterogeneous Wireless Networks ◽  
Vehicular Network ◽  
Time Cost ◽  
Transportation Industry ◽  
Network Resources ◽  
Bandwidth Aggregation ◽  
Coding Scheme

The rapid development of the transportation industry has brought about the demand for massive data transmission. In order to make use of a large number of heterogeneous network resources in vehicular network, the research of applying network coding to multipath transmission has become a hot topic. Network coding can better solve the problems of packet reordering and low aggregation efficiency. The determination of coding scale is the key to network coding scheme. However, the existing research cannot adapt to the different characteristics of network resources in vehicular network, leading to larger decoding time cost and lower bandwidth aggregation efficiency. In this paper, we propose a network coding scheme called Delay Determined Group Size (DDGS), which could adaptively adjust the coding group according to the heterogeneous wireless networks state. The mathematical analysis and process design of the DDGS scheme are discussed in detail. Through a large number of simulations, we proved that the DDGS scheme is significantly superior to other coding group determination schemes in terms of decoding time cost and bandwidth aggregation efficiency.

scholarly journals An Improved Flooding Routing Protocol for Wireless Sensor Networks Based on Network-Coding

2018 ◽  
Vol 17 ◽  
pp. 02001
Author(s):  
Churan Tang ◽  
Linghua Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Coding ◽  
Routing Protocol ◽  
Network Reliability ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Bandwidth Utilization ◽  
Network Utilization ◽  
Save Energy

A central question in wireless sensor network research is how to reduce the consumption of the energy of the sensor nodes. Theoretically, the network coding technology proposed by Ahlswede et al (2000) can improve the network reliability and network throughput, increase the robustness and save energy. Based on the classic flooding routing protocol, the present study proposes a new flooding control protocol, i.e. NC-Flooding for wireless sensor networks. NC-Flooding protocol introduces five mechanisms to enhance the efficiency of wireless sensor networks. As shown by MATLAB simulation results, NC-Flooding protocol reduces the number of broadcasts of wireless sensor networks, increases the throughput of the network and increases the bandwidth utilization. We conclude that NC-Flooding protocol reduces data forwarding cost and node energy consumption and extends nodes’ life cycle, thus increasing network utilization.

The Gamification in Education, Healthcare, and Industry

2021 ◽  
pp. 206-232
Author(s):  
Puvvadi Baby Maruthi
Keyword(s):  
Data Aggregation ◽  
Mobile Element ◽  
Mobile Node ◽  
Base Station ◽  
Sensor Nodes ◽  
Aggregated Data ◽  
Three Layer Architecture ◽  
Save Energy ◽  
Aggregation Technique ◽  
Entire Network

Wireless sensor networks (WSN) consist of large numbers of sensor nodes, which are limited in battery power and communication range and have multi-modal sensing capabilities. In this chapter, energy-efficient data aggregation technique is proposed to improve the lifetime of the sensor. Here, the author has used three layer architecture by deploying mobile element/node, which can periodically visit cluster heads (CHs) at which first level data aggregation has been applied to eliminate redundancy. After collecting data from all CHs, mobile element itself will perform second level of data aggregation to eliminate further redundancy. After collecting data from CHs, mobile element will move towards base station/sink and transmits data to base station/sink in order to save energy of entire network. Here, the author has made an attempt to prove that in WSN during data gathering if mobile elements are used to collect the aggregated data from CHs, energy consumption of the entire network will be reduced. The proposed data aggregation with mobile node helps in improving the lifetime of the WSN.

System Design and Energy Management for Indoor Solar Energy Harvesting Under Consideration of Spectral Characteristics of Solar Cells

2013 ◽  
Vol 3 (1) ◽  
pp. 1-15 ◽  
Author(s):  
Christian Viehweger ◽  
Thomas Keutel ◽  
Laura Kasper ◽  
Tim Pfeifer ◽  
Olfa Kanoun
Keyword(s):  
Solar Cells ◽  
Energy Harvesting ◽  
Energy Management ◽  
High Efficiency ◽  
Spectral Characteristics ◽  
Sensor Nodes ◽  
Light Sources ◽  
Wireless Sensor Nodes ◽  
Solar Energy Harvesting ◽  
Difficult Situations

A standardized characterization method for solar cells is only available for outdoor use. For the supply of wireless sensor nodes with energy harvesting also indoor applications are of interest. Without comparable values it is difficult to select the proper cell for defined environmental conditions. Therefore it is necessary to make an investigation on their behavior individually to be able to make a selection. The work presented here shows the characterization of solar cells according to their spectral behavior, the influence of illumination and the usage of this information about the maximum power to design an energy management. Therefore a test structure with a monochromator, different light sources, source measure units and instruments for measuring intensity and spectra has been developed. The measurements help to select the best solar cell out of a repertory for indoor energy harvesting applications. As for indoor applications also the ability to make use of weak light and a high efficiency is important, the energy management has been improved using a dual DC/DC strategy that allows it to make efficient use of solar cells within difficult situations.

scholarly journals High Efficiency RF Energy Harvester for IoT Embedded Sensor Nodes

2019 ◽  
Author(s):  
Stylianos D. Assimonis ◽  
Spyridon N. Daskalakis ◽  
Vincent Fusco ◽  
Manos M. Tentzeris ◽  
Apostolos Georgiadis
Keyword(s):  
Energy Harvester ◽  
High Efficiency ◽  
Sensor Nodes ◽  
Rf Energy ◽  
Rf Energy Harvester

scholarly journals Data Publish/Subscribe with Network Coding in DTN

2016 ◽  
Vol 12 (06) ◽  
pp. 51
Author(s):  
Xia Yi ◽  
Deng Guanghong
Keyword(s):  
Network Coding ◽  
Ant Colony Algorithm ◽  
Random Network ◽  
Large Data ◽  
Network Capacity ◽  
Delay Tolerant Network ◽  
Delivery Performance ◽  
Coding Method ◽  
Delay Tolerant ◽  
Working Out

A data Publish/Subscribe method with network coding (DPS-NC) used in delay tolerant network is proposed. Based on the publish/subscribe mechanism, the topic data were encoded and transmit with random network coding method, which can take full advantage of the network capacity to multicast. At the same time, for working out the problem of large data redundancy and vast invalid de-liveries in the network coding broadcast process, a packet routing scheme based on ant colony algorithm was brought. In the end, some simulation experiments are carried out and results show that the DPS-NC method can get better delivery performance.

scholarly journals Multi-Hop Dynamic Map Data Propagation Algorithm for Clustered Vehicular Networks

Electronics ◽  
2020 ◽  
Vol 9 (10) ◽  
pp. 1728
Author(s):  
Odilbek Urmonov ◽  
HyungWon Kim
Keyword(s):  
Large Scale ◽  
Vehicular Networks ◽  
Dynamic Environment ◽  
Driving Safety ◽  
Local Dynamic ◽  
Vehicular Communication ◽  
Data Propagation ◽  
Dynamic Map ◽  
Map Data ◽  
Transmission Windows

To ensure the driving safety in vehicular network, it is necessary to construct a local dynamic map (LDM) for an extended range. Using the standard vehicular communication protocols, however, vehicles can construct the LDM for only one-hop range. Constructing large-scale LDM is highly challenging because vehicles randomly change their position. This paper proposes a dynamic map propagation (DMP) method, which builds a large aggregated LDM data using a multi-hop communication. To reduce the data overhead, we introduce an efficient clustering method based on a half-circle of the forwarder’s wireless range. The DMP elects one forwarder per cluster, which constructs LDM and forwards it to a neighbor cluster. The inter-cluster interference is minimized by allocating a different transmit window to each cluster. DMP copes with a dynamic environment by frequently re-electing the forwarders and their associated transmission windows. Simulation results reveal that DMP enhances the forwarders’ reception ratio by 20%, while extending LDM dissemination range by 29% over a previous work.

Sign in / Sign up

Export Citation Format

Share Document