Title of article :
Energy Measure Semigraph-Based Connected Edge Domination Routing Algorithm in Wireless Sensor Networks
Author/Authors :
Suriya Praba, T. School of Computing - SASTRA Deemed University, Tanjavur, India , Sethukarasi, T. Department of CSE - R. M. K. Engineering College, Gummidipoondi, India , Saravanan, S. Department of Mathematics - R. M. D. Engineering College, Chennai, India
Pages :
10
From page :
1
To page :
10
Abstract :
In wireless sensor networks (WSNs), batteries are used as power source which is limited, and replacement of the battery is difficult. Since communication between nodes consumes most of the node power, topology-based power control is essential for reducing energy consumption. It is necessary to use optimized topology-based energy control model, so the selected nodes are used to generate a virtual backbone, which reduces unwanted routing of data. The virtual backbone for optimized topology can be created by connected dominating set (CDS) of graph theory. However, generating the virtual backbone by using the CDS algorithm is an NP-hard problem because of larger network size. To overcome this problem, in this paper, a novel distributed connected edge dominating set-based semigraph model (S-CEDS) is proposed. The performance ratio of the proposed S-CEDS is measured as (4 + ln∆′) |opt|, where |opt| represents the network size. The proposed S-CEDS is implemented using the ns-2 simulator and evaluated with conventional routing protocols such as AODV and DSDV. The results show that the proposed S-CEDS approach increases throughput and network lifetime. Also, it reduces energy consumption and average number of hops required for data transmission.
Farsi abstract :
فاقد چكيده فارسي
Keywords :
Energy Measure Semigraph-Based , Edge Domination Routing Algorithm , Wireless Sensor Networks
Journal title :
Mobile Information Systems
Serial Year :
2019
Full Text URL :
Record number :
2606777
Link To Document :
بازگشت