Limits...
Prolonging the lifetime of wireless sensor networks interconnected to fixed network using hierarchical energy tree based routing algorithm.

Kalpana M, Dhanalakshmi R, Parthiban P - ScientificWorldJournal (2014)

Bottom Line: This research work proposes a mathematical model for the lifetime of wireless sensor networks (WSN).The algorithms are evaluated in WSNs interconnected to fixed network with seven distribution patterns, simulated in ns2 and compared with the existing algorithms based on the parameters such as number of data packets, throughput, network lifetime, and data packets average network lifetime product.Evaluation and simulation results show that the combination of HETRA and TCP/EXP maximizes longer network lifetime in all the patterns.

View Article: PubMed Central - PubMed

Affiliation: Department of Communication Systems, Sethu Institute of Technology, Virudhunagar 626 115, India.

ABSTRACT
This research work proposes a mathematical model for the lifetime of wireless sensor networks (WSN). It also proposes an energy efficient routing algorithm for WSN called hierarchical energy tree based routing algorithm (HETRA) based on hierarchical energy tree constructed using the available energy in each node. The energy efficiency is further augmented by reducing the packet drops using exponential congestion control algorithm (TCP/EXP). The algorithms are evaluated in WSNs interconnected to fixed network with seven distribution patterns, simulated in ns2 and compared with the existing algorithms based on the parameters such as number of data packets, throughput, network lifetime, and data packets average network lifetime product. Evaluation and simulation results show that the combination of HETRA and TCP/EXP maximizes longer network lifetime in all the patterns. The lifetime of the network with HETRA algorithm has increased approximately 3.2 times that of the network implemented with AODV.

Show MeSH

Related in: MedlinePlus

Node “a” or “b” senses the data and transmits to the base station “x.”
© Copyright Policy - open-access
Related In: Results  -  Collection


getmorefigures.php?uid=PMC4227355&req=5

fig3: Node “a” or “b” senses the data and transmits to the base station “x.”

Mentions: The total power consumed (PT) is given by power consumed by a node for sensing and processing, transmitting the packet to the neighbor nodes and receiving the packets by the intermediate nodes. There are a number of intermediate nodes involved for forwarding the sensed data packet towards the base station. The total power (PT) should include the power consumed by all these nodes. Hence, the power consumed is multiplied by the average number of nodes involved for transmission of sensed data to the base station node. In a wireless sensor network, all the nodes are distributed over the sensing field based on a particular topology or pattern. The phenomenon to be sensed could occur at any place randomly. This phenomenon will be sensed by the node closer to the occurrence of the phenomenon. The node sensing the phenomenon could be a node closer to the base station node. Hence, the number of nodes involved in transmitting the sensed data may vary. But the minimum number of nodes involved in a transmission should be 2 as shown in Figure 3.


Prolonging the lifetime of wireless sensor networks interconnected to fixed network using hierarchical energy tree based routing algorithm.

Kalpana M, Dhanalakshmi R, Parthiban P - ScientificWorldJournal (2014)

Node “a” or “b” senses the data and transmits to the base station “x.”
© Copyright Policy - open-access
Related In: Results  -  Collection

Show All Figures
getmorefigures.php?uid=PMC4227355&req=5

fig3: Node “a” or “b” senses the data and transmits to the base station “x.”
Mentions: The total power consumed (PT) is given by power consumed by a node for sensing and processing, transmitting the packet to the neighbor nodes and receiving the packets by the intermediate nodes. There are a number of intermediate nodes involved for forwarding the sensed data packet towards the base station. The total power (PT) should include the power consumed by all these nodes. Hence, the power consumed is multiplied by the average number of nodes involved for transmission of sensed data to the base station node. In a wireless sensor network, all the nodes are distributed over the sensing field based on a particular topology or pattern. The phenomenon to be sensed could occur at any place randomly. This phenomenon will be sensed by the node closer to the occurrence of the phenomenon. The node sensing the phenomenon could be a node closer to the base station node. Hence, the number of nodes involved in transmitting the sensed data may vary. But the minimum number of nodes involved in a transmission should be 2 as shown in Figure 3.

Bottom Line: This research work proposes a mathematical model for the lifetime of wireless sensor networks (WSN).The algorithms are evaluated in WSNs interconnected to fixed network with seven distribution patterns, simulated in ns2 and compared with the existing algorithms based on the parameters such as number of data packets, throughput, network lifetime, and data packets average network lifetime product.Evaluation and simulation results show that the combination of HETRA and TCP/EXP maximizes longer network lifetime in all the patterns.

View Article: PubMed Central - PubMed

Affiliation: Department of Communication Systems, Sethu Institute of Technology, Virudhunagar 626 115, India.

ABSTRACT
This research work proposes a mathematical model for the lifetime of wireless sensor networks (WSN). It also proposes an energy efficient routing algorithm for WSN called hierarchical energy tree based routing algorithm (HETRA) based on hierarchical energy tree constructed using the available energy in each node. The energy efficiency is further augmented by reducing the packet drops using exponential congestion control algorithm (TCP/EXP). The algorithms are evaluated in WSNs interconnected to fixed network with seven distribution patterns, simulated in ns2 and compared with the existing algorithms based on the parameters such as number of data packets, throughput, network lifetime, and data packets average network lifetime product. Evaluation and simulation results show that the combination of HETRA and TCP/EXP maximizes longer network lifetime in all the patterns. The lifetime of the network with HETRA algorithm has increased approximately 3.2 times that of the network implemented with AODV.

Show MeSH
Related in: MedlinePlus