scholarly journals A Fast and Reliable Hybrid Data Delivery Protocol for Large-Scale Heterogeneous Sensor Networks

2012 ◽  
Vol 8 (1) ◽  
pp. 890238
Author(s):  
Sanggil Kang ◽  
Yujin Lim ◽  
Wilmarc Lopez ◽  
Hoyoung Hwang
Keyword(s):  
Sensor Networks ◽  
Large Scale ◽  
Delivery Ratio ◽  
Data Delivery ◽  
Aggregated Data ◽  
Heterogeneous Sensor Networks ◽  
Assignment Algorithm ◽  
Fitness Value ◽  
Hybrid Data ◽  
Delivery Protocol

We propose a hybrid data delivery method for the large-scale heterogeneous sensor networks, which is a fast and reliable delivery protocol for the aggregated data from the sinks to the GW. We develop a new multicriteria-ranking algorithm which determines multiple forwarders for each hop by ranking neighbor nodes. To rank the nodes, we compute the fitness value using features for each node such as the received signal strength, nodal delay, and hop distance. We determine the time of sending among forwarders using the waiting time assignment algorithm. In the experimental section, we show that our method outperforms conventional data delivery protocols in terms of data delivery ratio and end-to-end delay.

scholarly journals Hybrid Position-Based and DTN Forwarding for Vehicular Sensor Networks

2012 ◽  
Vol 8 (4) ◽  
pp. 186146 ◽  
Author(s):  
Fan Li ◽  
Lei Zhao ◽  
Xiumei Fan ◽  
Yu Wang
Keyword(s):  
Sensor Networks ◽  
Routing Protocols ◽  
Large Scale ◽  
Vehicular Networks ◽  
Ad Hoc ◽  
Delivery Ratio ◽  
Data Delivery ◽  
Ad Hoc Routing ◽  
Efficient Data ◽  
Set Up

Efficient data delivery in vehicular sensor networks is still a challenging research issue. Position-based routing protocols have been proven to be more suitable for dynamic vehicular networks or large-scale mobile sensor networks than traditional ad hoc routing protocols. However, position-based routing assumes that intermediate nodes can always be found to set up an end-to-end connection between the source and the destination; otherwise, it suffers from network partitions which are very common in vehicular networks and leads to poor performances. This paper addresses data delivery challenge in the possible intermittently connected vehicular sensor networks by combining position-based forwarding strategy with store-carry-forward routing scheme from delay tolerant networks. The proposed routing method makes use of vehicle driving direction to determine whether holding or forwarding the packet. Experimental results show that the proposed mechanism outperforms existing position-based solutions in terms of packet delivery ratio.

GRAdient Broadcast: A Robust Data Delivery Protocol for Large Scale Sensor Networks

2005 ◽  
Vol 11 (3) ◽  
pp. 285-298 ◽  
Author(s):  
Fan Ye ◽  
Gary Zhong ◽  
Songwu Lu ◽  
Lixia Zhang
Keyword(s):  
Sensor Networks ◽  
Large Scale ◽  
Data Delivery ◽  
Delivery Protocol

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

scholarly journals Resilient greedy routing on GPS-free surface sensor networks

2020 ◽  
Vol 16 (4) ◽  
pp. 155014772091381
Author(s):  
Buri Ban ◽  
Xuan Li ◽  
Miao Jin
Keyword(s):  
Sensor Networks ◽  
Large Scale ◽  
Three Dimensional ◽  
Network Routing ◽  
Time Interval ◽  
Delivery Ratio ◽  
Greedy Routing ◽  
Routing Scheme ◽  
Random Node ◽  
Routing Methods

We design a greedy routing scheme specifically for GPS-free large-scale wireless sensor networks deployed on surfaces of complex-connected three-dimensional settings. Compared with other greedy embedding–based surface network routing scheme, the proposed one is cut free such that no pair of nodes suffers a long detour to reach each other. The routing scheme is designed to be resilient to node or link failures especially under random node or link failure model where each node in a network has an equal and independent probability of failure during some time interval. The proposed algorithm is fully distributed and scalable to both the size and the topological complexity of a network. Each sensor node requires only limited and constant storage. Simulation results show the proposed routing scheme with a higher successful delivery ratio, a lower average stretch factor, and a lower normalized communication cost compared with other resilient routing methods.

scholarly journals Secure Trust Based Key Management Routing Framework for Wireless Sensor Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-9 ◽  
Author(s):  
Jugminder Kaur ◽  
Sandeep S. Gill ◽  
Balwinder S. Dhaliwal
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Key Management ◽  
Secure Routing ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Data Delivery ◽  
Key Predistribution ◽  
Random Key Predistribution ◽  
Key Predistribution Scheme

Security is always a major concern in wireless sensor networks (WSNs). Several trust based routing protocols are designed that play an important role in enhancing the performance of a wireless network. However they still have some disadvantages like limited energy resources, susceptibility to physical capture, and little protection against various attacks due to insecure wireless communication channels. This paper presents a secure trust based key management (STKF) routing framework that establishes a secure trustworthy route depending upon the present and past node to node interactions. This route is then updated by isolating the malicious or compromised nodes from the route, if any, and a dedicated link is created between every pair of nodes in the selected route with the help of “q” composite random key predistribution scheme (RKPS) to ensure data delivery from source to destination. The performance of trust aware secure routing framework (TSRF) is compared with the proposed routing scheme. The results indicate that STKF provides an effective mechanism for finding out a secure route with better trustworthiness than TSRF which avoids the data dropping, thereby increasing the data delivery ratio. Also the distance required to reach the destination in the proposed protocol is less hence effectively utilizing the resources.

scholarly journals Predicted Fitness Based Clustering Algorithm for Manets

2019 ◽  
Vol 8 (6) ◽  
pp. 488-494
Keyword(s):  
Clustering Algorithm ◽  
Battery Life ◽  
Delivery Ratio ◽  
Data Delivery ◽  
Node Mobility ◽  
Network Simulator ◽  
Frequent Change ◽  
Trust Value ◽  
Packet Delivery ◽  
Fitness Value

Secure data delivery, mobility, link lifetime, energy consumption and delay are the most important parameters to be highly concentrated in the self-organised network named manets. Where in Manets the nodes move unpredictably in any direction with restricted battery life, resulting in frequent change in topology and due to mobility the trust in packet delivery will suffer inside the network. These constraints are studied broadly to ensure the secured data delivery and the lifetime of such networks. In this paper we propose a PFCA(Predicted fitness based clustering) algorithm using fitness value. The cluster heads are selected based on the fitness value of the nodes. Whereas the fitness value is calculated using the trust value, link lifetime for different type of node mobility and energy consumed and the clusters are formed using the PFCA clustering algorithm. The proposed PFC algorithm is experimented in the NS-2 network simulator and the results are compared with the existing PSO-clustering algorithm. The results show the effectiveness of our proposed algorithm in terms of network overhead, average number of clusters formed, average number of re-clustering required, delay and packet delivery ratio.

scholarly journals Routing Protocols in Underwater Acoustic Sensor Networks: A Quantitative Comparison

2015 ◽  
Vol 2015 ◽  
pp. 1-11 ◽  
Author(s):  
Guangjie Han ◽  
Na Bao ◽  
Li Liu ◽  
Daqiang Zhang ◽  
Lei Shu
Keyword(s):  
Sensor Networks ◽  
Routing Protocols ◽  
Delivery Ratio ◽  
Data Delivery ◽  
Acoustic Sensor ◽  
Underwater Acoustic Sensor Networks ◽  
Underwater Acoustic ◽  
End To End Delay ◽  
Acoustic Sensor Networks ◽  
Control Packets

Underwater Acoustic Sensor Networks (UASNs) have drawn great attention for their potential value in ocean monitoring and offshore exploration. In order to make the underwater application possible, the unique characteristics of underwater acoustic channels and continuous node movement inspired the emergence of routing protocols for underwater environment. In this paper, we introduce and compare four prominent routing protocols proposed for UASNs, namely, H2-DAB, GEDAR, E-PULRP, and PER. Performances of the routing protocols are evaluated in terms of the average number of control packets, end-to-end delay, data delivery ratio, and total energy consumption. The impact of water currents on the routing algorithms is also analyzed in our simulation. Experimental results demonstrate that E-PULRP provides high data delivery ratio at the cost of end-to-end delay. H2-DAB has better real-time performance for minimal delay transmission. GEDAR efficiently addresses the problem of void region without introducing extra energy. PER requires the most control packets in the process of routing establishment. Our work aims to provide useful insights to select appropriate routing protocols to fulfil different application requirements in UASNs.

Sign in / Sign up

Export Citation Format

Share Document