A Novel Routing Scheme to Avoid Link Error and Packet Dropping in Wireless Sensor Networks

Kavitha, M.; Ramakrishnan, B.; Daş, Resul

doi:10.22247/ijcna/2016/v3/i4/48569

Cited by 4 publications

(3 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Major advantages of WSNs are the ability to cover harsh terrains, reliability, accuracy and nevertheless at a possibly lower cost. A great body of research has discussed the benefits of WSNs [4,5,6]. Our objective in this work is to modify the LEACH protocol to enhance the overall network lifetime.…”

Section: Introductionmentioning

confidence: 99%

MA-LEACH: Energy Efficient Routing Protocol for WSNs using Particle Swarm Optimization and Mobile Aggregator

Elsayed¹,

Sharaf²

2018

ijcna

View full text Add to dashboard Cite

-Routing protocols for wireless sensor networks pay a great attention to the limited resources of the nodes. As battery lifetime is a major concern, we consider our proposed model as an effort to prolong the network lifetime in harmony with WSNs' constraints. In this paper, we study LEACH routing protocol and its performance and propose an extension to it, MA-LEACH. We introduce a mobile aggregator (MA) which is a gadget adopted to mitigate the overhead on the cluster heads (CHs). In addition, we optimize the trajectory using particle swarm optimization (PSO). Hence, we adapt the TSP problem to our protocol to determine the optimal trajectory that a mobile aggregator could travel to visit every cluster head in the network. We simulate the proposed protocol in MATLAB and the results reveal that it outperforms LEACH in network lifetime and energy consumption. Also, we compare our findings with a recent extension to the LEACH called LEACH with fuzzy descriptors and with clustered heterogeneous sensor networks (CHSNs) with a mobile sink. The simulation results show that MA-LEACH surpasses LEACH with fuzzy descriptor and CHSNs.

show abstract

Section: Introductionmentioning

confidence: 99%

MA-LEACH: Energy Efficient Routing Protocol for WSNs using Particle Swarm Optimization and Mobile Aggregator

Elsayed¹,

Sharaf²

2018

ijcna

View full text Add to dashboard Cite

show abstract

“…Compared with flat routing schemes [9][10][11], those schemes based on clustering [12][13][14][15] can effectively improve the network scalability. While in clustering routing, sensor nodes are generally divided into two parts, which are Cluster Header (CH) and Cluster Member (CM).…”

Section: Introductionmentioning

confidence: 99%

An improved clustering routing mechanism for wireless Ad hoc network

Wang

Han

2017

IFS

View full text Add to dashboard Cite

Abstract. In Wireless Ad hoc Networks (WANET), to organize sensor nodes for data collection is an important research issue. Clustering is an effective technique for prolonging the network lifetime. However, the Cluster Header (CH) in a cluster always involves a lot of data forwarding tasks, rather than its Cluster Members (CMs). This energy consumption overloading inevitably leads to the "hot spot" problem. With these in mind, an Energy-Balanced and Unequally-Layered Routing Protocol (EBULRP) is proposed in this article. The main emphasis is on balancing the energy consumption among CHs. In our design, the network is decoupled into multiple layers with different width, where the radius of clusters is differentiated at each layer. The core is to organize those CHs closer to the sink node, with more energy for inter-cluster data forwarding. Simulation results show that the proposed EBULRP effectively balances the energy consumption among CHs, and further prolongs the network lifetime.

show abstract

“…In [1], it is explained that this window serves to thwart the communication link between the communicating nodes from getting overwhelmed by traffic. Overwhelmed networks lead to packet losses, which according to [2] may be caused by malicious packet dropping and link error.…”

Section: Introductionmentioning

confidence: 99%

Evaluation of TCP Congestion Control Modus Operandi in Mesh Networks

Nyangaresi¹,

Ogara²,

Abeka³

2017

ijcna

View full text Add to dashboard Cite

-In mesh networks, the sender machine is connected to the receiver machine via multiple paths. Efficient transmissions along these paths require proper link choice so as to quickly deliver the packets the destination. Poor link selection can lead to overutilization of some links while the other redundant links remain underutilized. Over-utilized links experience heavy congestions under peak hours. The transmission control protocol (TCP) employs congestion control algorithms to prevent transmitters from overloading the network with data. These algorithms include slow start, congestion avoidance, fast retransmit and fast recovery. The slow start algorithm is utilized during the initial communication phase while congestion avoidance, fast retransmit and fast recovery are reactionary algorithms one packet loss is detected. This paper aimed to analyze the behavior of TCP under these congestion control algorithms in wired mesh networks. The dimensions that were used for this analysis included three way handshake, packet loss, duplicate acknowledgements, segment retransmissions, recovery, I/O plots and time-sequence plots. The objective of this study was to practically understand how the TCP protocol detects and handles network congestions in mesh networks. To achieve this objective, an experimental research design was employed. It involved the practical design of experimental setups that were used to collect data that was analyzed to provide an explanation of the TCP congestion control mechanisms. The results obtained indicate that the TCP first carries out a three handshake before data transmission can take place. It was also observed that the receipt of three duplicate acknowledgements is interpreted by TCP to be packet loss caused by network congestion. Moreover, it was established that TCP initiates fast retransmit and fast recovery when packet loss is detected. The contribution of this paper lies in the fact that it provided a practical understanding of how TCP detects and reacts to mesh network congestion, a concept that is critical to network administrators in their quest for packet loss prevention over the TCP architecture. Towards the end of the paper, suggestions for developing better ways of congestion handling in mesh networks by use of round trip times as a basis for adaptive congestion detection and control are elaborated.

show abstract

A Novel Routing Scheme to Avoid Link Error and Packet Dropping in Wireless Sensor Networks

Cited by 4 publications

References 16 publications

MA-LEACH: Energy Efficient Routing Protocol for WSNs using Particle Swarm Optimization and Mobile Aggregator

MA-LEACH: Energy Efficient Routing Protocol for WSNs using Particle Swarm Optimization and Mobile Aggregator

An improved clustering routing mechanism for wireless Ad hoc network

Evaluation of TCP Congestion Control Modus Operandi in Mesh Networks

Contact Info

Product

Resources

About