Research ArticleImproved Route Discovery Based on ConstructingConnected Dominating Set in MANET
Zifen Yang1 Deqian Fu12 Lihua Han1 and Seong Tae Jhang3
1School of Informatics Linyi University Linyi 276005 China2Provincial Key Laboratory for Network Based Intelligent Computing University of Jinan Jinan 250022 China3Department of Computer The University of Suwon Hwaseong-si Gyeonggi-do 445-743 Republic of Korea
Correspondence should be addressed to Deqian Fu fudeqianlyueducn
Received 16 January 2015 Accepted 15 April 2015
Academic Editor Hideyuki Takahashi
Copyright copy 2015 Zifen Yang et al This is an open access article distributed under the Creative Commons Attribution Licensewhich permits unrestricted use distribution and reproduction in any medium provided the original work is properly cited
A mobile ad hoc network (MANET) is widely applied in various urgent scenarios benefiting from its feature that the hosts cancommunicate with each other without any physical infrastructure An efficient routing function plays a critical role in MANETand routing based on CDS is a promising approach In this paper a novel approach is proposed to obtain a stable routing pathand prolong lifetime of MANET by integrating three factors such as energy mobility and degree for the status of node minimumconnected dominating set (SoN-MCDS) Extensive simulations show that the proposed protocol is superior to other classical onesin terms of lifetime and low energy consumption
1 Introduction
Because it is hard to communicate effectively in infras-tructured networks many infrastructures were damaged indisasters such as earthquake and flooding MANET providesan instant anddistributed peer to peer ad hoc communicationamong equipment An Ad hoc network is a collection ofwireless mobile hosts (also called nodes) such as notebooksmobile phones or the other portable equipment that com-municate with each other by wireless channels RecentlyMANET is often applied in disaster relief operations as aneffective facility [1] However an issue is that two nodes ina MANET can communicate directly if and only if they arewithin same radio transmission ranges Hence an intuitivechoice is to introduce a strategy of multihop routing inMANET [2]
MANET routing protocols can be divided into twogroups flat and hierarchical routing protocols according tothe logic of the network structure In a flat routing protocolevery node is set to equal status and discovers a routewith a broadcasting scheme In this case every node has torepeat sending or receiving broadcast signals Moreover ina network with dynamic topology routing tables have to be
updated frequently Unfortunately the flooding of broadcastsignals especially for frequent broadcasting consumes toomuch battery power and even may lead to congestion as wellIn hierarchical routing protocol backbone-based routingpattern can significantly reduce the energy consumption inan ad hoc networkWhen a node wants to sendmessage to itsdestination it only needs to send the message to backboneunless the destination is one of its neighbors Obviouslythe number of update routing messages is significantlyreduced compared with the number in the network witha flat routing protocol while for backbone-based strategya direct requirement is that all backbone nodes should beconnected The connected backbone is called a connecteddominating set (CDS) For routing based on CDS there aremany advantages such as restrict search spaceThus floodingstorm can be avoided routing overhead can be reduced andless energy can be consumed so that the lifetime of MANETcan be prolonged Based on all of the above considerationswe propose a novel approach to construct SoN-MCDS byintegrating three factors energy mobility and degree
The rest of the paper is organized as follows In Section 2the system model and definitions are presented and therelated works are discussed In Section 3 the algorithm of
Hindawi Publishing CorporationInternational Journal of Distributed Sensor NetworksVolume 2015 Article ID 612102 7 pageshttpdxdoiorg1011552015612102
2 International Journal of Distributed Sensor Networks
Figure 1 UDG model
forming and fast repairing SoN-MCDS is presented andusing SoN-MCDS to implement route discovery is describedin Section 4 In Section 5 some simulation results are shownto prove the performance of the proposed algorithm Finallya conclusion is drawn in Section 6
2 Related Work
Throughout this paper some notations in our algorithm aredenoted as follows
119873(119906) neighbors set for node 119906
119864rm(119906) remaining energy of node 119906
119864in(119906) initial energy of node 119906
ST(119906) the current state of node 119906
119899119871119894119904119905 a list of nodes in MANET
DS dominating set
CDS connected dominating set
21 Network Model and Related Definition TraditionallyUnit Disk Graph (UDG) is utilized to model MANET asillustrated in Figure 1 As well three related definitions arepresented as follows
Definition 1 (unit disk graph (UDG)) UDG is a 2-dimentional plane graph that for every 119906 V isin 119881 thereis a bidirectional edge between 119906 and V if and only ifEudist(119906 V) le 1 Here Eudist(119906 V) le 1 is the Euclideandistance between 119906 and V
Definition 2 (dominating set (DS)) Given graph 119866 = (119881 119864)1198811015840sube 119881 is a DS of 119866 = (119881 119864) only if for every (119906 V) isin 119864
either 119906 isin 1198811015840 or V isin 119881
1015840 is true
Definition 3 (connected dominating set (CDS)) (119862 sube 119881) isa CDS of 119866 if (1) 119862 is a DS and (2) a graph induced by 119862 isconnected
22 Related Works on Finding MCDS In graph theoryfinding theminimumCDS is NP-hard [3] Many works [4ndash7]try to construct minimum CDS with two kinds of methodsThe reduction-based methods [4 5] construct a CDS fromone node with maximum degree Initially a node is coloredand its neighbors are colored with other color Then the sizeof CDS is reduced by some rules to delete some nodes Onthe other hand the increase-based methods [6 7] compute aDS at first and then select some nodes to connect the nodesin DS
However the two kinds of methods did not considertwo problems limited energy and the mobility of the nodeIn disaster relief operations as we all known there are fewchances to recharge the battery powered device Also nodesin MANET may move freely and randomly Many works[8ndash12] take energy issue into consideration A survey [8] ofenergy efficient scheduling mechanisms in sensor networksis given by Wang and Xiao An algorithm [12] on calculatingpower-aware connected dominating sets for efficient routingin ad hoc wireless network is proposed byWu et al The algo-rithm constructs a CDS according to two rules concerningenergy and degree of nodes Ramalakshmi and Radhakrish-nan proposed an improving route discovery algorithm [13]using stable connected dominating set in MANETs utilizingthree phases to construct aCDSNeighbor discovery is imple-mented at the first phases then the remaining two stages areconstructing and pruning the constructed CDS Ramrekha etal proposed an energy efficient and scalable routing protocol[14] for extreme emergency ad hoc communications Thealgorithm selects routing path depending on the length ofroute and the remaining energy Yu et al have proposedenergy efficient algorithm [15] to construct a dominatingtree in wireless ad hoc and sensor networks The algorithmobtains theoretically an approximation factor up to 9 with anefficient computational cost of 119874(119899) for message complexityand119874(119899) for time complexity which results in consuming lessenergy in ad hoc network
Some recent results focus on the mobility of nodes inconstructing CDS A mobility based clustering approach [16]is proposed by An and Papavassiliou to support mobilitymanagement and multicast routing in mobile ad hoc wirelessnetwork A localized virtual backbone construction scheme[17] is proposed by Wang et al to connect maximal inde-pendent set with multiple initiators The algorithm takesnode stability into consideration and constructs the backbonequickly
Furthermore no proper mechanism to handle and savecritical node failure in existing ad hoc routing protocolsso that the network consumes more battery power evenleads to node failure Revathi and Rangaswamy [18] proposedefficient flooding and repairing local route with stable CDSfor mobile ad hoc networks A node with minimum velocityand maximum signal strength is selected as a dominatorHowever the degree and energy of node are not considered
Therefore it is observed that the energy and movementof nodes make significant reflection of the construction ofvirtual backbone with minimum numbers of nodes In thispaper we take into account three factors of energy mobilityand degree of nodes to propose an energy efficient protocol
International Journal of Distributed Sensor Networks 3
aiming to get a stable path for routing and prolong lifetime ofnetwork
3 Forming and Fast Repairing SoN-MCDS
Based on the above considerations we observed that energyand mobility provide a significant reflection of the stabilityand the lifetime of MANET Hence when one source nodewants to sendmessage to destination the proposed algorithmtakes into account three aspects such as the remaining energyof node119906 the velocity of119906 and the degree of119906 at current stateThis protocol works in three stages The first stage is SoN-DSformation and the second stage is connecting and pruningSoN-MCDS If one of the nodes or links is broken for somereasons the third stage will be executed
31 The Definition of ST(119906) The current status of node ST(119906)is defined as (1) considering factors of energy degree andmobility of node 119906
Definition 4 (the mobility of a node) 119881119904considers its
neighbor set and its mobility factors can be valued as thepercentage of neighbors which remains the same between 119905
time and 119905 + 1 time With the symmetric difference 119881119904 the
algorithm can select more stable nodes as dominating node
119881119904=
119873119905+1
(119906) 119873119905(119906)
119873119905+1 (119906) cup 119873119905 (119906) (2)
where the form of 119860 119861 denotes the symmetric differencebetween two sets 119860 and 119861
Definition 5 (the energymetric of a node) 119864119904is defined as (3)
The metrics 119864119904help algorithm to select energy-rich nodes
119864119904=
119864rm (119906)
119864in (119906) (3)
32 A Three-Phase Algorithm for Constructing and FastRepairing SoN-MCDS In this section we propose a three-phase algorithm to construct and repair SoN-MCDS
321 Phase One Constructing SoN-DS Originally a list ofnodes 119899119871119894119904119905 ordered by ST(119906) has to be prepared in advanceIn MANET every mobile node says hello to its neighborswith message ⟨ST(119906)119873(119906)⟩ Then each node V isin 119881 in 119899119871119894119904119905
is sorted by comparing two nodes ⟨119906 V⟩ with the followingsimple rules
Rule 1 119906 is stored in 119899119871119894119904119905 if ST(119906) gt ST(V)
Rule 2 119906 is stored in 119899119871119894119904119905 if 119864119904(119906) gt 119864
119904(V) when ST(119906) =
ST(V)
Rule 3 119906 is stored in 119899119871119894119904119905 if degree(119906) gt degree(V) whenST(119906) = ST(V) 119864
119904(119906) = 119864
119904(V)
Input a connected graph 119866(119881 119864)
Output a dominate set119863(1) 119863 = Oslash 119871119890119899 = |119881|
(2) For each V isin 119881
(3) 119888119900119897119900119903(V) = 119882119867119868119879119864(4) End for(5) For 119894 = 1 2 119871119890119899 do(6) 119906 = 119899119871119894119904119905[119894](7) If 119888119900119897119900119903(119906) = 119866119877119860119884
(8) 119888119900119897119900119903(119906) = 119861119871119860119862119870(9) End if(10) For each V isin 119873(119906)
(11) If 119888119900119897119900119903(V) == 119882119867119868119879119864
(12) 119888119900119897119900119903(V) = 119866119877119860119884(13) End if(14) End for(15)119863 = 119863 cup 119906(16) End for
Algorithm 1 Forming SoN-DS
The process of forming SoN-DS is described in Algo-rithm 1 Initially all nodes of MANET are marked in whitecolor The first node 119906 in 119899119871119894119904119905 is considered as a dominatingnode and marked in black color then all the neighbors ofnode 119906 are marked in gray After that the remaining nodes in119899119871119894119904119905 repeat the same operations until no white node is in theMANET Finally a ST-CDS is formed by all the black nodes
322 Phase Two Constructing SoN-MCDS In this stage wewill construct a CDS andminimize its size which is describedin Algorithm 2 At first the first node of 119899119871119894119904119905 is consideredas a leader Then for each node in 119863 excluding the leaderdoes a path without cycle between the node and the leaderexist If no path exists a path must be created via selectinggray nodes as the relay nodes The number of relay nodes isas smaller as possible The operations are repeated until allthe black nodes are connected Then all selected gray nodesare marked black As a result SoN-MCDS is constructed byall the black nodes Further the size of the constructed SoN-MCDS can be reduced via deleting extra black nodes
323 Phase Three Repairing SoN-MCDS Locally In thisphase an algorithm is presented for repairing SoN-MCDSlocally as described in Algorithm 3 If some nodes are deac-tivated due to reasons such as limited energy the topologyof the MANET has to be rebuilt Hence a new SoN-MCDSmust be reconstructedwith expensive cost of time and energyFortunately the deactivated nodes only affect the local nodesHence Algorithm 3 focuses on repairing SoN-MCDS locally
4 Route Discovery Using SoN-MCDS
Generally routing protocols in MANET are classified intotable-driven on-demanding and hybrid routing In table-driven routing protocol each node maintains route table
4 International Journal of Distributed Sensor Networks
Input A connected graph 119866(119881 119864) and119863
(4) If there is no path between 119906 and leader then(5) Create the shortest path via GRAY node(6) End if(7) If the path is a cycle then(8) Select another short path(9) Mark the selected GRAY node with BLACK(10) End if(11) End for(12) 119878 consists of all the BLACK nodes(13) For each V isin 119881
(14) If 119888119900119897119900119903(V) = 119866119877119860119884
(15) For each 119906 isin 119873(V)(16) If 119888119900119897119900119903(119906) = 119861119871119860119862119870
(17) 119888119900119906119899119905 + +(18) End if(19) End for(20) If 119888119900119906119899119905 ge 2
(21) Choose any 119906 isin 119873(V)(22) 119878 = 119878 119906
(23) End if(24) End if(25) End for
Algorithm 2 Forming SoN-MCDS
Inputthe broken node Va connected graph 119866(119881 119864)
Output Son-MCDS(1) If 119888119900119897119900119903(V) = 119866119877119860119884
(2) Free (V)(3) End if(4) If 119888119900119897119900119903(V) = 119861119871119860119862119870
(5) 1198811015840 = 119873(V) cup All the neighboring nodes of119873(V) in SoN-MCDS(6) 119864
with all paths to every destination from the node In on-demanding routing protocols like AODV and DSR [19] thesource node will start the process of route discovery when ithas no route to the destinationThe source node broadcasts aroute request packet (RREQ) to its neighbors at first In turnevery receiving node broadcasts the RREQ packet until thepacket reaches the destination Finally the destination nodewill send the route reply message (RREP) to the source afterreceiving the RREQ packet However this protocol leads toan issue of broadcast storm especially in MANET with largescale To solve the problem more efficiently we implemented
a route discovery process in AODV with the proposed SoN-MCDS When SoN-MCDS node receives a RREQ packetit broadcasts the packet But the nodes out of SoN-MCDSonly receive the packet So the number of RREQ packets isreduced and the network congestionmay be avoided to a largeextent
5 Simulation and Analysis
51 Simulation Settings In this section we simulate thealgorithm with Matlab program to prove the efficiency
International Journal of Distributed Sensor Networks 5
Table 1
Parameter ValueArea size 1000lowast 1000m2
Traffic type Constant bit rate (CBR)Packet size 512 bytesMAC protocol IEEE 80211Transmission range 250mBandwidth 2MbpsQueue size 50 packetsMobility model Random waypoint modelTransmission power 0667WReceiving power 0365WIdle power 01WMaximum speed 5 10 15 20 25
50 100 150 20020
30
40
50
60
70
80
90
100
Number of nodes
Aver
age C
DS
size
Wu-CDSMaxS-CDS
Ours
Figure 2 Average size of CDS
The experiments are repeated for 50 trials with differentnetwork sizes and speeds of mobile nodes The experimentalconfiguration is listed as follows a rectangular grid of rangingfrom 5lowast5 to 1000lowast1000m2 and 5ndash200 points are distributedrandomly over the grid The other parameters are listed asshown in Table 1
52 Result Analysis The average CDS size with varyingnetwork sizes is shown in Figure 2 The average CDS sizeof SoN-MCDS is smaller than MaxS-CDS [18] thanks tointegrating three factors of energy mobility and degree Butour result is larger than Wu-CDS [3] The cause is that onlythe uncovered neighbors of the largest degree are selected asthe virtual backbone with the algorithm of Wu-CDS
The average route lengthwith increasing number of nodesis depicted in Figure 3 As expected the higher the CDS sizethe shorter the route length
The total energy consumed with different maximumspeed with increasing number of nodes is shown in Figure 4
40 60 80 100 120 140 160 180 200 2202
3
4
5
6
7
8
9
10
Number of nodes
Aver
age r
oute
leng
th
Wu-CDSMaxS-CDS
Ours
Figure 3 Average route length
5 10 15 20 2515
20
25
30
35
40
45
Maximum speed (ms)
AODVWu-CDS
MaxS-CDSOurs
Aver
age c
onsu
med
lowast102
(J)
Figure 4 The total energy consumed with different maximumspeed
With the increasing node speed the existing path may befrequently damaged So another CDS must be constructedby consuming more energy Therefore our algorithm onlyconsiders the nodes moving slowly to be the backbone ofnetwork so that the constructed CDS with our methodis more stable and the risk of reconstructing operations isreduced
Note that although the algorithm ofWU-CDS gets a goodresult ofminimum size CDS it does not guarantee an optimalnetwork performance The total energy consumption of theprotocols increases with the increasing node speed
The lifetime of network with increasing number of nodesis illustrated in Figure 5 Obviously our result shows that thenodes with more residual energy are selected as backbone
6 International Journal of Distributed Sensor Networks
50 100 150 200
40
60
80
100
120
140
160
180
Number of nodes
Num
ber o
f rou
nds
AODVMaxS-CDS
Ours
Figure 5 Average lifetime of network
nodes As a consequence the lifetime of the network canbe prolonged significantly That is the survival time can beprolonged in emergency situations to provide more opportu-nities for the rescue
6 Conclusion
In this paper we propose an energy efficient protocol to usea stable path for routing and prolong lifetime of MANETTheproposed protocol forms SoN-MCDS to do the broadcastand data transmission considering three factors of energymovements and degree of nodes Simulation results showthat our work is superior to other methods
Conflict of Interests
The authors declare that there is no conflict of interestsregarding the publication of this paper
Acknowledgments
This work was supported by GRRC program of GyeonggiProvince [(GRRCSUWON2014-B1)Cooperative Recognitionand Response System Based on Tension Sensing] and alsosupported by Shandong Provincial Natural Science Founda-tion (ZR2014FL022) China
References
[1] H-C Jang Y-N Lien and T-C Tsai ldquoRescue informationsystem for earthquake disasters based on MANET emer-gency communication platformrdquo in Proceedings of the ACMInternational Wireless Communications and Mobile ComputingConference (IWCMC rsquo09) pp 623ndash627 Leipzig Germany June2009
[2] A Ephremides J E Wieselthier and D J Baker ldquoA designconcept for reliable mobile radio networks with frequency
hopping signalingrdquo Proceedings of the IEEE vol 75 no 1 pp56ndash73 1987
[3] B N Clark C J Colbourn and D Johnson ldquoUnit disk graphsrdquoDiscrete Mathematics vol 86 no 1ndash3 pp 165ndash177 1990
[4] C Zheng S-X Sun andT-YHuang ldquoConstructing distributedconnected dominating sets in wireless ad hoc and sensornetworksrdquo Journal of Software vol 22 no 5 pp 1053ndash1066 2011
[5] F Dai and J Wu ldquoAn extended localized algorithm for con-nected dominating set formation in ad hoc wireless networksrdquoIEEE Transactions on Parallel and Distributed Systems vol 15no 10 pp 908ndash920 2004
[6] P-JWan KM Alzoubi and O Frieder ldquoDistributed construc-tion of connected dominating set in wireless AdHoc networksrdquoMobile Networks and Applications vol 9 no 2 pp 141ndash1492004
[7] Y LiM TThai FWang C-W Yi P-JWan andD-Z Du ldquoOngreedy construction of connected dominating sets in wirelessnetworksrdquo Wireless Communications and Mobile Computingvol 5 no 8 pp 927ndash932 2005
[8] L Wang and Y Xiao ldquoA survey of energy-efficient schedulingmechanisms in sensor networksrdquo Mobile Networks and Appli-cations vol 11 no 5 pp 723ndash740 2006
[9] K K Shukla and S Sah ldquoConstruction and maintenance ofvirtual backbone in wireless networksrdquo Wireless Networks vol19 no 5 pp 969ndash984 2013
[10] F Wang M Min Y Li and D Du ldquoOn the construction ofstable virtual backbones in mobile ad-hoc networksrdquo in Pro-ceedings of the 24th IEEE International Performance Computingand Communications Conference (IPCCC rsquo05) pp 355ndash362April 2005
[11] P-R SheuH-Y Tsai Y-P Lee and J-Y Cheng ldquoOn calculatingstable connected dominating sets based on link stability formobile ad hoc networksrdquo Tamkang Journal of Science andEngineering vol 12 no 4 pp 417ndash428 2009
[12] J Wu F Dai M Gao and I Stojmenovic ldquoOn calculatingpower-aware connected dominating sets for efficient routingin ad hoc wireless networksrdquo Journal of Communications andNetworks vol 4 no 1 pp 59ndash70 2002
[13] R Ramalakshmi and S Radhakrishnan ldquoImproving routediscovery using stable connected dominating set in MANETSrdquoInternational Journal onApplications ofGraphTheory inWirelessAd Hoc Networks and Sensor Networks vol 4 no 1 pp 15ndash252012
[14] T A Ramrekha V N Talooki J Rodriguez and C PolitisldquoEnergy efficient and scalable routing protocol for extremeemergency ad hoc communicationsrdquo Mobile Networks andApplications vol 17 no 2 pp 312ndash324 2012
[15] R Yu X Wang Y Liu and S K Das ldquoEnergy-efficientdominating tree construction in wireless ad hoc and sensornetworksrdquo in Distributed Computing and Networking pp 558ndash569 Springer Berlin Germany 2008
[16] B An and S Papavassiliou ldquoA mobility-based clusteringapproach to support mobility management and multicast rout-ing in mobile ad-hoc wireless networksrdquo International Journalof Network Management vol 11 no 6 pp 387ndash395 2001
[17] F Wang M Min Y Li and D Du ldquoOn the constructionof stable virtual backbones in mobile ad-hoc networksrdquo inProceedings for the 24th IEEE International Performance Com-puting and Communications Conference (IPCCC rsquo05) pp 355ndash362 April 2005
International Journal of Distributed Sensor Networks 7
[18] S Revathi and T R Rangaswamy ldquoEfficient flooding and localroute repair using stable connected dominating set for mobilead hoc networksrdquo Asian Journal of Scientific Research vol 7 no1 pp 102ndash109 2014
[19] Y-L Chang and C-C Hsu ldquoRouting in wirelessmobile ad-hocnetworks via dynamic group constructionrdquo Mobile Networksand Applications vol 5 no 1 pp 27ndash37 2000
2 International Journal of Distributed Sensor Networks
Figure 1 UDG model
forming and fast repairing SoN-MCDS is presented andusing SoN-MCDS to implement route discovery is describedin Section 4 In Section 5 some simulation results are shownto prove the performance of the proposed algorithm Finallya conclusion is drawn in Section 6
2 Related Work
Throughout this paper some notations in our algorithm aredenoted as follows
119873(119906) neighbors set for node 119906
119864rm(119906) remaining energy of node 119906
119864in(119906) initial energy of node 119906
ST(119906) the current state of node 119906
119899119871119894119904119905 a list of nodes in MANET
DS dominating set
CDS connected dominating set
21 Network Model and Related Definition TraditionallyUnit Disk Graph (UDG) is utilized to model MANET asillustrated in Figure 1 As well three related definitions arepresented as follows
Definition 1 (unit disk graph (UDG)) UDG is a 2-dimentional plane graph that for every 119906 V isin 119881 thereis a bidirectional edge between 119906 and V if and only ifEudist(119906 V) le 1 Here Eudist(119906 V) le 1 is the Euclideandistance between 119906 and V
Definition 2 (dominating set (DS)) Given graph 119866 = (119881 119864)1198811015840sube 119881 is a DS of 119866 = (119881 119864) only if for every (119906 V) isin 119864
either 119906 isin 1198811015840 or V isin 119881
1015840 is true
Definition 3 (connected dominating set (CDS)) (119862 sube 119881) isa CDS of 119866 if (1) 119862 is a DS and (2) a graph induced by 119862 isconnected
22 Related Works on Finding MCDS In graph theoryfinding theminimumCDS is NP-hard [3] Many works [4ndash7]try to construct minimum CDS with two kinds of methodsThe reduction-based methods [4 5] construct a CDS fromone node with maximum degree Initially a node is coloredand its neighbors are colored with other color Then the sizeof CDS is reduced by some rules to delete some nodes Onthe other hand the increase-based methods [6 7] compute aDS at first and then select some nodes to connect the nodesin DS
However the two kinds of methods did not considertwo problems limited energy and the mobility of the nodeIn disaster relief operations as we all known there are fewchances to recharge the battery powered device Also nodesin MANET may move freely and randomly Many works[8ndash12] take energy issue into consideration A survey [8] ofenergy efficient scheduling mechanisms in sensor networksis given by Wang and Xiao An algorithm [12] on calculatingpower-aware connected dominating sets for efficient routingin ad hoc wireless network is proposed byWu et al The algo-rithm constructs a CDS according to two rules concerningenergy and degree of nodes Ramalakshmi and Radhakrish-nan proposed an improving route discovery algorithm [13]using stable connected dominating set in MANETs utilizingthree phases to construct aCDSNeighbor discovery is imple-mented at the first phases then the remaining two stages areconstructing and pruning the constructed CDS Ramrekha etal proposed an energy efficient and scalable routing protocol[14] for extreme emergency ad hoc communications Thealgorithm selects routing path depending on the length ofroute and the remaining energy Yu et al have proposedenergy efficient algorithm [15] to construct a dominatingtree in wireless ad hoc and sensor networks The algorithmobtains theoretically an approximation factor up to 9 with anefficient computational cost of 119874(119899) for message complexityand119874(119899) for time complexity which results in consuming lessenergy in ad hoc network
Some recent results focus on the mobility of nodes inconstructing CDS A mobility based clustering approach [16]is proposed by An and Papavassiliou to support mobilitymanagement and multicast routing in mobile ad hoc wirelessnetwork A localized virtual backbone construction scheme[17] is proposed by Wang et al to connect maximal inde-pendent set with multiple initiators The algorithm takesnode stability into consideration and constructs the backbonequickly
Furthermore no proper mechanism to handle and savecritical node failure in existing ad hoc routing protocolsso that the network consumes more battery power evenleads to node failure Revathi and Rangaswamy [18] proposedefficient flooding and repairing local route with stable CDSfor mobile ad hoc networks A node with minimum velocityand maximum signal strength is selected as a dominatorHowever the degree and energy of node are not considered
Therefore it is observed that the energy and movementof nodes make significant reflection of the construction ofvirtual backbone with minimum numbers of nodes In thispaper we take into account three factors of energy mobilityand degree of nodes to propose an energy efficient protocol
International Journal of Distributed Sensor Networks 3
aiming to get a stable path for routing and prolong lifetime ofnetwork
3 Forming and Fast Repairing SoN-MCDS
Based on the above considerations we observed that energyand mobility provide a significant reflection of the stabilityand the lifetime of MANET Hence when one source nodewants to sendmessage to destination the proposed algorithmtakes into account three aspects such as the remaining energyof node119906 the velocity of119906 and the degree of119906 at current stateThis protocol works in three stages The first stage is SoN-DSformation and the second stage is connecting and pruningSoN-MCDS If one of the nodes or links is broken for somereasons the third stage will be executed
31 The Definition of ST(119906) The current status of node ST(119906)is defined as (1) considering factors of energy degree andmobility of node 119906
Definition 4 (the mobility of a node) 119881119904considers its
neighbor set and its mobility factors can be valued as thepercentage of neighbors which remains the same between 119905
time and 119905 + 1 time With the symmetric difference 119881119904 the
algorithm can select more stable nodes as dominating node
119881119904=
119873119905+1
(119906) 119873119905(119906)
119873119905+1 (119906) cup 119873119905 (119906) (2)
where the form of 119860 119861 denotes the symmetric differencebetween two sets 119860 and 119861
Definition 5 (the energymetric of a node) 119864119904is defined as (3)
The metrics 119864119904help algorithm to select energy-rich nodes
119864119904=
119864rm (119906)
119864in (119906) (3)
32 A Three-Phase Algorithm for Constructing and FastRepairing SoN-MCDS In this section we propose a three-phase algorithm to construct and repair SoN-MCDS
321 Phase One Constructing SoN-DS Originally a list ofnodes 119899119871119894119904119905 ordered by ST(119906) has to be prepared in advanceIn MANET every mobile node says hello to its neighborswith message ⟨ST(119906)119873(119906)⟩ Then each node V isin 119881 in 119899119871119894119904119905
is sorted by comparing two nodes ⟨119906 V⟩ with the followingsimple rules
Rule 1 119906 is stored in 119899119871119894119904119905 if ST(119906) gt ST(V)
Rule 2 119906 is stored in 119899119871119894119904119905 if 119864119904(119906) gt 119864
119904(V) when ST(119906) =
ST(V)
Rule 3 119906 is stored in 119899119871119894119904119905 if degree(119906) gt degree(V) whenST(119906) = ST(V) 119864
119904(119906) = 119864
119904(V)
Input a connected graph 119866(119881 119864)
Output a dominate set119863(1) 119863 = Oslash 119871119890119899 = |119881|
(2) For each V isin 119881
(3) 119888119900119897119900119903(V) = 119882119867119868119879119864(4) End for(5) For 119894 = 1 2 119871119890119899 do(6) 119906 = 119899119871119894119904119905[119894](7) If 119888119900119897119900119903(119906) = 119866119877119860119884
(8) 119888119900119897119900119903(119906) = 119861119871119860119862119870(9) End if(10) For each V isin 119873(119906)
(11) If 119888119900119897119900119903(V) == 119882119867119868119879119864
(12) 119888119900119897119900119903(V) = 119866119877119860119884(13) End if(14) End for(15)119863 = 119863 cup 119906(16) End for
Algorithm 1 Forming SoN-DS
The process of forming SoN-DS is described in Algo-rithm 1 Initially all nodes of MANET are marked in whitecolor The first node 119906 in 119899119871119894119904119905 is considered as a dominatingnode and marked in black color then all the neighbors ofnode 119906 are marked in gray After that the remaining nodes in119899119871119894119904119905 repeat the same operations until no white node is in theMANET Finally a ST-CDS is formed by all the black nodes
322 Phase Two Constructing SoN-MCDS In this stage wewill construct a CDS andminimize its size which is describedin Algorithm 2 At first the first node of 119899119871119894119904119905 is consideredas a leader Then for each node in 119863 excluding the leaderdoes a path without cycle between the node and the leaderexist If no path exists a path must be created via selectinggray nodes as the relay nodes The number of relay nodes isas smaller as possible The operations are repeated until allthe black nodes are connected Then all selected gray nodesare marked black As a result SoN-MCDS is constructed byall the black nodes Further the size of the constructed SoN-MCDS can be reduced via deleting extra black nodes
323 Phase Three Repairing SoN-MCDS Locally In thisphase an algorithm is presented for repairing SoN-MCDSlocally as described in Algorithm 3 If some nodes are deac-tivated due to reasons such as limited energy the topologyof the MANET has to be rebuilt Hence a new SoN-MCDSmust be reconstructedwith expensive cost of time and energyFortunately the deactivated nodes only affect the local nodesHence Algorithm 3 focuses on repairing SoN-MCDS locally
4 Route Discovery Using SoN-MCDS
Generally routing protocols in MANET are classified intotable-driven on-demanding and hybrid routing In table-driven routing protocol each node maintains route table
4 International Journal of Distributed Sensor Networks
Input A connected graph 119866(119881 119864) and119863
(4) If there is no path between 119906 and leader then(5) Create the shortest path via GRAY node(6) End if(7) If the path is a cycle then(8) Select another short path(9) Mark the selected GRAY node with BLACK(10) End if(11) End for(12) 119878 consists of all the BLACK nodes(13) For each V isin 119881
(14) If 119888119900119897119900119903(V) = 119866119877119860119884
(15) For each 119906 isin 119873(V)(16) If 119888119900119897119900119903(119906) = 119861119871119860119862119870
(17) 119888119900119906119899119905 + +(18) End if(19) End for(20) If 119888119900119906119899119905 ge 2
(21) Choose any 119906 isin 119873(V)(22) 119878 = 119878 119906
(23) End if(24) End if(25) End for
Algorithm 2 Forming SoN-MCDS
Inputthe broken node Va connected graph 119866(119881 119864)
Output Son-MCDS(1) If 119888119900119897119900119903(V) = 119866119877119860119884
(2) Free (V)(3) End if(4) If 119888119900119897119900119903(V) = 119861119871119860119862119870
(5) 1198811015840 = 119873(V) cup All the neighboring nodes of119873(V) in SoN-MCDS(6) 119864
with all paths to every destination from the node In on-demanding routing protocols like AODV and DSR [19] thesource node will start the process of route discovery when ithas no route to the destinationThe source node broadcasts aroute request packet (RREQ) to its neighbors at first In turnevery receiving node broadcasts the RREQ packet until thepacket reaches the destination Finally the destination nodewill send the route reply message (RREP) to the source afterreceiving the RREQ packet However this protocol leads toan issue of broadcast storm especially in MANET with largescale To solve the problem more efficiently we implemented
a route discovery process in AODV with the proposed SoN-MCDS When SoN-MCDS node receives a RREQ packetit broadcasts the packet But the nodes out of SoN-MCDSonly receive the packet So the number of RREQ packets isreduced and the network congestionmay be avoided to a largeextent
5 Simulation and Analysis
51 Simulation Settings In this section we simulate thealgorithm with Matlab program to prove the efficiency
International Journal of Distributed Sensor Networks 5
Table 1
Parameter ValueArea size 1000lowast 1000m2
Traffic type Constant bit rate (CBR)Packet size 512 bytesMAC protocol IEEE 80211Transmission range 250mBandwidth 2MbpsQueue size 50 packetsMobility model Random waypoint modelTransmission power 0667WReceiving power 0365WIdle power 01WMaximum speed 5 10 15 20 25
50 100 150 20020
30
40
50
60
70
80
90
100
Number of nodes
Aver
age C
DS
size
Wu-CDSMaxS-CDS
Ours
Figure 2 Average size of CDS
The experiments are repeated for 50 trials with differentnetwork sizes and speeds of mobile nodes The experimentalconfiguration is listed as follows a rectangular grid of rangingfrom 5lowast5 to 1000lowast1000m2 and 5ndash200 points are distributedrandomly over the grid The other parameters are listed asshown in Table 1
52 Result Analysis The average CDS size with varyingnetwork sizes is shown in Figure 2 The average CDS sizeof SoN-MCDS is smaller than MaxS-CDS [18] thanks tointegrating three factors of energy mobility and degree Butour result is larger than Wu-CDS [3] The cause is that onlythe uncovered neighbors of the largest degree are selected asthe virtual backbone with the algorithm of Wu-CDS
The average route lengthwith increasing number of nodesis depicted in Figure 3 As expected the higher the CDS sizethe shorter the route length
The total energy consumed with different maximumspeed with increasing number of nodes is shown in Figure 4
40 60 80 100 120 140 160 180 200 2202
3
4
5
6
7
8
9
10
Number of nodes
Aver
age r
oute
leng
th
Wu-CDSMaxS-CDS
Ours
Figure 3 Average route length
5 10 15 20 2515
20
25
30
35
40
45
Maximum speed (ms)
AODVWu-CDS
MaxS-CDSOurs
Aver
age c
onsu
med
lowast102
(J)
Figure 4 The total energy consumed with different maximumspeed
With the increasing node speed the existing path may befrequently damaged So another CDS must be constructedby consuming more energy Therefore our algorithm onlyconsiders the nodes moving slowly to be the backbone ofnetwork so that the constructed CDS with our methodis more stable and the risk of reconstructing operations isreduced
Note that although the algorithm ofWU-CDS gets a goodresult ofminimum size CDS it does not guarantee an optimalnetwork performance The total energy consumption of theprotocols increases with the increasing node speed
The lifetime of network with increasing number of nodesis illustrated in Figure 5 Obviously our result shows that thenodes with more residual energy are selected as backbone
6 International Journal of Distributed Sensor Networks
50 100 150 200
40
60
80
100
120
140
160
180
Number of nodes
Num
ber o
f rou
nds
AODVMaxS-CDS
Ours
Figure 5 Average lifetime of network
nodes As a consequence the lifetime of the network canbe prolonged significantly That is the survival time can beprolonged in emergency situations to provide more opportu-nities for the rescue
6 Conclusion
In this paper we propose an energy efficient protocol to usea stable path for routing and prolong lifetime of MANETTheproposed protocol forms SoN-MCDS to do the broadcastand data transmission considering three factors of energymovements and degree of nodes Simulation results showthat our work is superior to other methods
Conflict of Interests
The authors declare that there is no conflict of interestsregarding the publication of this paper
Acknowledgments
This work was supported by GRRC program of GyeonggiProvince [(GRRCSUWON2014-B1)Cooperative Recognitionand Response System Based on Tension Sensing] and alsosupported by Shandong Provincial Natural Science Founda-tion (ZR2014FL022) China
References
[1] H-C Jang Y-N Lien and T-C Tsai ldquoRescue informationsystem for earthquake disasters based on MANET emer-gency communication platformrdquo in Proceedings of the ACMInternational Wireless Communications and Mobile ComputingConference (IWCMC rsquo09) pp 623ndash627 Leipzig Germany June2009
[2] A Ephremides J E Wieselthier and D J Baker ldquoA designconcept for reliable mobile radio networks with frequency
hopping signalingrdquo Proceedings of the IEEE vol 75 no 1 pp56ndash73 1987
[3] B N Clark C J Colbourn and D Johnson ldquoUnit disk graphsrdquoDiscrete Mathematics vol 86 no 1ndash3 pp 165ndash177 1990
[4] C Zheng S-X Sun andT-YHuang ldquoConstructing distributedconnected dominating sets in wireless ad hoc and sensornetworksrdquo Journal of Software vol 22 no 5 pp 1053ndash1066 2011
[5] F Dai and J Wu ldquoAn extended localized algorithm for con-nected dominating set formation in ad hoc wireless networksrdquoIEEE Transactions on Parallel and Distributed Systems vol 15no 10 pp 908ndash920 2004
[6] P-JWan KM Alzoubi and O Frieder ldquoDistributed construc-tion of connected dominating set in wireless AdHoc networksrdquoMobile Networks and Applications vol 9 no 2 pp 141ndash1492004
[7] Y LiM TThai FWang C-W Yi P-JWan andD-Z Du ldquoOngreedy construction of connected dominating sets in wirelessnetworksrdquo Wireless Communications and Mobile Computingvol 5 no 8 pp 927ndash932 2005
[8] L Wang and Y Xiao ldquoA survey of energy-efficient schedulingmechanisms in sensor networksrdquo Mobile Networks and Appli-cations vol 11 no 5 pp 723ndash740 2006
[9] K K Shukla and S Sah ldquoConstruction and maintenance ofvirtual backbone in wireless networksrdquo Wireless Networks vol19 no 5 pp 969ndash984 2013
[10] F Wang M Min Y Li and D Du ldquoOn the construction ofstable virtual backbones in mobile ad-hoc networksrdquo in Pro-ceedings of the 24th IEEE International Performance Computingand Communications Conference (IPCCC rsquo05) pp 355ndash362April 2005
[11] P-R SheuH-Y Tsai Y-P Lee and J-Y Cheng ldquoOn calculatingstable connected dominating sets based on link stability formobile ad hoc networksrdquo Tamkang Journal of Science andEngineering vol 12 no 4 pp 417ndash428 2009
[12] J Wu F Dai M Gao and I Stojmenovic ldquoOn calculatingpower-aware connected dominating sets for efficient routingin ad hoc wireless networksrdquo Journal of Communications andNetworks vol 4 no 1 pp 59ndash70 2002
[13] R Ramalakshmi and S Radhakrishnan ldquoImproving routediscovery using stable connected dominating set in MANETSrdquoInternational Journal onApplications ofGraphTheory inWirelessAd Hoc Networks and Sensor Networks vol 4 no 1 pp 15ndash252012
[14] T A Ramrekha V N Talooki J Rodriguez and C PolitisldquoEnergy efficient and scalable routing protocol for extremeemergency ad hoc communicationsrdquo Mobile Networks andApplications vol 17 no 2 pp 312ndash324 2012
[15] R Yu X Wang Y Liu and S K Das ldquoEnergy-efficientdominating tree construction in wireless ad hoc and sensornetworksrdquo in Distributed Computing and Networking pp 558ndash569 Springer Berlin Germany 2008
[16] B An and S Papavassiliou ldquoA mobility-based clusteringapproach to support mobility management and multicast rout-ing in mobile ad-hoc wireless networksrdquo International Journalof Network Management vol 11 no 6 pp 387ndash395 2001
[17] F Wang M Min Y Li and D Du ldquoOn the constructionof stable virtual backbones in mobile ad-hoc networksrdquo inProceedings for the 24th IEEE International Performance Com-puting and Communications Conference (IPCCC rsquo05) pp 355ndash362 April 2005
International Journal of Distributed Sensor Networks 7
[18] S Revathi and T R Rangaswamy ldquoEfficient flooding and localroute repair using stable connected dominating set for mobilead hoc networksrdquo Asian Journal of Scientific Research vol 7 no1 pp 102ndash109 2014
[19] Y-L Chang and C-C Hsu ldquoRouting in wirelessmobile ad-hocnetworks via dynamic group constructionrdquo Mobile Networksand Applications vol 5 no 1 pp 27ndash37 2000
International Journal of Distributed Sensor Networks 3
aiming to get a stable path for routing and prolong lifetime ofnetwork
3 Forming and Fast Repairing SoN-MCDS
Based on the above considerations we observed that energyand mobility provide a significant reflection of the stabilityand the lifetime of MANET Hence when one source nodewants to sendmessage to destination the proposed algorithmtakes into account three aspects such as the remaining energyof node119906 the velocity of119906 and the degree of119906 at current stateThis protocol works in three stages The first stage is SoN-DSformation and the second stage is connecting and pruningSoN-MCDS If one of the nodes or links is broken for somereasons the third stage will be executed
31 The Definition of ST(119906) The current status of node ST(119906)is defined as (1) considering factors of energy degree andmobility of node 119906
Definition 4 (the mobility of a node) 119881119904considers its
neighbor set and its mobility factors can be valued as thepercentage of neighbors which remains the same between 119905
time and 119905 + 1 time With the symmetric difference 119881119904 the
algorithm can select more stable nodes as dominating node
119881119904=
119873119905+1
(119906) 119873119905(119906)
119873119905+1 (119906) cup 119873119905 (119906) (2)
where the form of 119860 119861 denotes the symmetric differencebetween two sets 119860 and 119861
Definition 5 (the energymetric of a node) 119864119904is defined as (3)
The metrics 119864119904help algorithm to select energy-rich nodes
119864119904=
119864rm (119906)
119864in (119906) (3)
32 A Three-Phase Algorithm for Constructing and FastRepairing SoN-MCDS In this section we propose a three-phase algorithm to construct and repair SoN-MCDS
321 Phase One Constructing SoN-DS Originally a list ofnodes 119899119871119894119904119905 ordered by ST(119906) has to be prepared in advanceIn MANET every mobile node says hello to its neighborswith message ⟨ST(119906)119873(119906)⟩ Then each node V isin 119881 in 119899119871119894119904119905
is sorted by comparing two nodes ⟨119906 V⟩ with the followingsimple rules
Rule 1 119906 is stored in 119899119871119894119904119905 if ST(119906) gt ST(V)
Rule 2 119906 is stored in 119899119871119894119904119905 if 119864119904(119906) gt 119864
119904(V) when ST(119906) =
ST(V)
Rule 3 119906 is stored in 119899119871119894119904119905 if degree(119906) gt degree(V) whenST(119906) = ST(V) 119864
119904(119906) = 119864
119904(V)
Input a connected graph 119866(119881 119864)
Output a dominate set119863(1) 119863 = Oslash 119871119890119899 = |119881|
(2) For each V isin 119881
(3) 119888119900119897119900119903(V) = 119882119867119868119879119864(4) End for(5) For 119894 = 1 2 119871119890119899 do(6) 119906 = 119899119871119894119904119905[119894](7) If 119888119900119897119900119903(119906) = 119866119877119860119884
(8) 119888119900119897119900119903(119906) = 119861119871119860119862119870(9) End if(10) For each V isin 119873(119906)
(11) If 119888119900119897119900119903(V) == 119882119867119868119879119864
(12) 119888119900119897119900119903(V) = 119866119877119860119884(13) End if(14) End for(15)119863 = 119863 cup 119906(16) End for
Algorithm 1 Forming SoN-DS
The process of forming SoN-DS is described in Algo-rithm 1 Initially all nodes of MANET are marked in whitecolor The first node 119906 in 119899119871119894119904119905 is considered as a dominatingnode and marked in black color then all the neighbors ofnode 119906 are marked in gray After that the remaining nodes in119899119871119894119904119905 repeat the same operations until no white node is in theMANET Finally a ST-CDS is formed by all the black nodes
322 Phase Two Constructing SoN-MCDS In this stage wewill construct a CDS andminimize its size which is describedin Algorithm 2 At first the first node of 119899119871119894119904119905 is consideredas a leader Then for each node in 119863 excluding the leaderdoes a path without cycle between the node and the leaderexist If no path exists a path must be created via selectinggray nodes as the relay nodes The number of relay nodes isas smaller as possible The operations are repeated until allthe black nodes are connected Then all selected gray nodesare marked black As a result SoN-MCDS is constructed byall the black nodes Further the size of the constructed SoN-MCDS can be reduced via deleting extra black nodes
323 Phase Three Repairing SoN-MCDS Locally In thisphase an algorithm is presented for repairing SoN-MCDSlocally as described in Algorithm 3 If some nodes are deac-tivated due to reasons such as limited energy the topologyof the MANET has to be rebuilt Hence a new SoN-MCDSmust be reconstructedwith expensive cost of time and energyFortunately the deactivated nodes only affect the local nodesHence Algorithm 3 focuses on repairing SoN-MCDS locally
4 Route Discovery Using SoN-MCDS
Generally routing protocols in MANET are classified intotable-driven on-demanding and hybrid routing In table-driven routing protocol each node maintains route table
4 International Journal of Distributed Sensor Networks
Input A connected graph 119866(119881 119864) and119863
(4) If there is no path between 119906 and leader then(5) Create the shortest path via GRAY node(6) End if(7) If the path is a cycle then(8) Select another short path(9) Mark the selected GRAY node with BLACK(10) End if(11) End for(12) 119878 consists of all the BLACK nodes(13) For each V isin 119881
(14) If 119888119900119897119900119903(V) = 119866119877119860119884
(15) For each 119906 isin 119873(V)(16) If 119888119900119897119900119903(119906) = 119861119871119860119862119870
(17) 119888119900119906119899119905 + +(18) End if(19) End for(20) If 119888119900119906119899119905 ge 2
(21) Choose any 119906 isin 119873(V)(22) 119878 = 119878 119906
(23) End if(24) End if(25) End for
Algorithm 2 Forming SoN-MCDS
Inputthe broken node Va connected graph 119866(119881 119864)
Output Son-MCDS(1) If 119888119900119897119900119903(V) = 119866119877119860119884
(2) Free (V)(3) End if(4) If 119888119900119897119900119903(V) = 119861119871119860119862119870
(5) 1198811015840 = 119873(V) cup All the neighboring nodes of119873(V) in SoN-MCDS(6) 119864
with all paths to every destination from the node In on-demanding routing protocols like AODV and DSR [19] thesource node will start the process of route discovery when ithas no route to the destinationThe source node broadcasts aroute request packet (RREQ) to its neighbors at first In turnevery receiving node broadcasts the RREQ packet until thepacket reaches the destination Finally the destination nodewill send the route reply message (RREP) to the source afterreceiving the RREQ packet However this protocol leads toan issue of broadcast storm especially in MANET with largescale To solve the problem more efficiently we implemented
a route discovery process in AODV with the proposed SoN-MCDS When SoN-MCDS node receives a RREQ packetit broadcasts the packet But the nodes out of SoN-MCDSonly receive the packet So the number of RREQ packets isreduced and the network congestionmay be avoided to a largeextent
5 Simulation and Analysis
51 Simulation Settings In this section we simulate thealgorithm with Matlab program to prove the efficiency
International Journal of Distributed Sensor Networks 5
Table 1
Parameter ValueArea size 1000lowast 1000m2
Traffic type Constant bit rate (CBR)Packet size 512 bytesMAC protocol IEEE 80211Transmission range 250mBandwidth 2MbpsQueue size 50 packetsMobility model Random waypoint modelTransmission power 0667WReceiving power 0365WIdle power 01WMaximum speed 5 10 15 20 25
50 100 150 20020
30
40
50
60
70
80
90
100
Number of nodes
Aver
age C
DS
size
Wu-CDSMaxS-CDS
Ours
Figure 2 Average size of CDS
The experiments are repeated for 50 trials with differentnetwork sizes and speeds of mobile nodes The experimentalconfiguration is listed as follows a rectangular grid of rangingfrom 5lowast5 to 1000lowast1000m2 and 5ndash200 points are distributedrandomly over the grid The other parameters are listed asshown in Table 1
52 Result Analysis The average CDS size with varyingnetwork sizes is shown in Figure 2 The average CDS sizeof SoN-MCDS is smaller than MaxS-CDS [18] thanks tointegrating three factors of energy mobility and degree Butour result is larger than Wu-CDS [3] The cause is that onlythe uncovered neighbors of the largest degree are selected asthe virtual backbone with the algorithm of Wu-CDS
The average route lengthwith increasing number of nodesis depicted in Figure 3 As expected the higher the CDS sizethe shorter the route length
The total energy consumed with different maximumspeed with increasing number of nodes is shown in Figure 4
40 60 80 100 120 140 160 180 200 2202
3
4
5
6
7
8
9
10
Number of nodes
Aver
age r
oute
leng
th
Wu-CDSMaxS-CDS
Ours
Figure 3 Average route length
5 10 15 20 2515
20
25
30
35
40
45
Maximum speed (ms)
AODVWu-CDS
MaxS-CDSOurs
Aver
age c
onsu
med
lowast102
(J)
Figure 4 The total energy consumed with different maximumspeed
With the increasing node speed the existing path may befrequently damaged So another CDS must be constructedby consuming more energy Therefore our algorithm onlyconsiders the nodes moving slowly to be the backbone ofnetwork so that the constructed CDS with our methodis more stable and the risk of reconstructing operations isreduced
Note that although the algorithm ofWU-CDS gets a goodresult ofminimum size CDS it does not guarantee an optimalnetwork performance The total energy consumption of theprotocols increases with the increasing node speed
The lifetime of network with increasing number of nodesis illustrated in Figure 5 Obviously our result shows that thenodes with more residual energy are selected as backbone
6 International Journal of Distributed Sensor Networks
50 100 150 200
40
60
80
100
120
140
160
180
Number of nodes
Num
ber o
f rou
nds
AODVMaxS-CDS
Ours
Figure 5 Average lifetime of network
nodes As a consequence the lifetime of the network canbe prolonged significantly That is the survival time can beprolonged in emergency situations to provide more opportu-nities for the rescue
6 Conclusion
In this paper we propose an energy efficient protocol to usea stable path for routing and prolong lifetime of MANETTheproposed protocol forms SoN-MCDS to do the broadcastand data transmission considering three factors of energymovements and degree of nodes Simulation results showthat our work is superior to other methods
Conflict of Interests
The authors declare that there is no conflict of interestsregarding the publication of this paper
Acknowledgments
This work was supported by GRRC program of GyeonggiProvince [(GRRCSUWON2014-B1)Cooperative Recognitionand Response System Based on Tension Sensing] and alsosupported by Shandong Provincial Natural Science Founda-tion (ZR2014FL022) China
References
[1] H-C Jang Y-N Lien and T-C Tsai ldquoRescue informationsystem for earthquake disasters based on MANET emer-gency communication platformrdquo in Proceedings of the ACMInternational Wireless Communications and Mobile ComputingConference (IWCMC rsquo09) pp 623ndash627 Leipzig Germany June2009
[2] A Ephremides J E Wieselthier and D J Baker ldquoA designconcept for reliable mobile radio networks with frequency
hopping signalingrdquo Proceedings of the IEEE vol 75 no 1 pp56ndash73 1987
[3] B N Clark C J Colbourn and D Johnson ldquoUnit disk graphsrdquoDiscrete Mathematics vol 86 no 1ndash3 pp 165ndash177 1990
[4] C Zheng S-X Sun andT-YHuang ldquoConstructing distributedconnected dominating sets in wireless ad hoc and sensornetworksrdquo Journal of Software vol 22 no 5 pp 1053ndash1066 2011
[5] F Dai and J Wu ldquoAn extended localized algorithm for con-nected dominating set formation in ad hoc wireless networksrdquoIEEE Transactions on Parallel and Distributed Systems vol 15no 10 pp 908ndash920 2004
[6] P-JWan KM Alzoubi and O Frieder ldquoDistributed construc-tion of connected dominating set in wireless AdHoc networksrdquoMobile Networks and Applications vol 9 no 2 pp 141ndash1492004
[7] Y LiM TThai FWang C-W Yi P-JWan andD-Z Du ldquoOngreedy construction of connected dominating sets in wirelessnetworksrdquo Wireless Communications and Mobile Computingvol 5 no 8 pp 927ndash932 2005
[8] L Wang and Y Xiao ldquoA survey of energy-efficient schedulingmechanisms in sensor networksrdquo Mobile Networks and Appli-cations vol 11 no 5 pp 723ndash740 2006
[9] K K Shukla and S Sah ldquoConstruction and maintenance ofvirtual backbone in wireless networksrdquo Wireless Networks vol19 no 5 pp 969ndash984 2013
[10] F Wang M Min Y Li and D Du ldquoOn the construction ofstable virtual backbones in mobile ad-hoc networksrdquo in Pro-ceedings of the 24th IEEE International Performance Computingand Communications Conference (IPCCC rsquo05) pp 355ndash362April 2005
[11] P-R SheuH-Y Tsai Y-P Lee and J-Y Cheng ldquoOn calculatingstable connected dominating sets based on link stability formobile ad hoc networksrdquo Tamkang Journal of Science andEngineering vol 12 no 4 pp 417ndash428 2009
[12] J Wu F Dai M Gao and I Stojmenovic ldquoOn calculatingpower-aware connected dominating sets for efficient routingin ad hoc wireless networksrdquo Journal of Communications andNetworks vol 4 no 1 pp 59ndash70 2002
[13] R Ramalakshmi and S Radhakrishnan ldquoImproving routediscovery using stable connected dominating set in MANETSrdquoInternational Journal onApplications ofGraphTheory inWirelessAd Hoc Networks and Sensor Networks vol 4 no 1 pp 15ndash252012
[14] T A Ramrekha V N Talooki J Rodriguez and C PolitisldquoEnergy efficient and scalable routing protocol for extremeemergency ad hoc communicationsrdquo Mobile Networks andApplications vol 17 no 2 pp 312ndash324 2012
[15] R Yu X Wang Y Liu and S K Das ldquoEnergy-efficientdominating tree construction in wireless ad hoc and sensornetworksrdquo in Distributed Computing and Networking pp 558ndash569 Springer Berlin Germany 2008
[16] B An and S Papavassiliou ldquoA mobility-based clusteringapproach to support mobility management and multicast rout-ing in mobile ad-hoc wireless networksrdquo International Journalof Network Management vol 11 no 6 pp 387ndash395 2001
[17] F Wang M Min Y Li and D Du ldquoOn the constructionof stable virtual backbones in mobile ad-hoc networksrdquo inProceedings for the 24th IEEE International Performance Com-puting and Communications Conference (IPCCC rsquo05) pp 355ndash362 April 2005
International Journal of Distributed Sensor Networks 7
[18] S Revathi and T R Rangaswamy ldquoEfficient flooding and localroute repair using stable connected dominating set for mobilead hoc networksrdquo Asian Journal of Scientific Research vol 7 no1 pp 102ndash109 2014
[19] Y-L Chang and C-C Hsu ldquoRouting in wirelessmobile ad-hocnetworks via dynamic group constructionrdquo Mobile Networksand Applications vol 5 no 1 pp 27ndash37 2000
(4) If there is no path between 119906 and leader then(5) Create the shortest path via GRAY node(6) End if(7) If the path is a cycle then(8) Select another short path(9) Mark the selected GRAY node with BLACK(10) End if(11) End for(12) 119878 consists of all the BLACK nodes(13) For each V isin 119881
(14) If 119888119900119897119900119903(V) = 119866119877119860119884
(15) For each 119906 isin 119873(V)(16) If 119888119900119897119900119903(119906) = 119861119871119860119862119870
(17) 119888119900119906119899119905 + +(18) End if(19) End for(20) If 119888119900119906119899119905 ge 2
(21) Choose any 119906 isin 119873(V)(22) 119878 = 119878 119906
(23) End if(24) End if(25) End for
Algorithm 2 Forming SoN-MCDS
Inputthe broken node Va connected graph 119866(119881 119864)
Output Son-MCDS(1) If 119888119900119897119900119903(V) = 119866119877119860119884
(2) Free (V)(3) End if(4) If 119888119900119897119900119903(V) = 119861119871119860119862119870
(5) 1198811015840 = 119873(V) cup All the neighboring nodes of119873(V) in SoN-MCDS(6) 119864
with all paths to every destination from the node In on-demanding routing protocols like AODV and DSR [19] thesource node will start the process of route discovery when ithas no route to the destinationThe source node broadcasts aroute request packet (RREQ) to its neighbors at first In turnevery receiving node broadcasts the RREQ packet until thepacket reaches the destination Finally the destination nodewill send the route reply message (RREP) to the source afterreceiving the RREQ packet However this protocol leads toan issue of broadcast storm especially in MANET with largescale To solve the problem more efficiently we implemented
a route discovery process in AODV with the proposed SoN-MCDS When SoN-MCDS node receives a RREQ packetit broadcasts the packet But the nodes out of SoN-MCDSonly receive the packet So the number of RREQ packets isreduced and the network congestionmay be avoided to a largeextent
5 Simulation and Analysis
51 Simulation Settings In this section we simulate thealgorithm with Matlab program to prove the efficiency
International Journal of Distributed Sensor Networks 5
Table 1
Parameter ValueArea size 1000lowast 1000m2
Traffic type Constant bit rate (CBR)Packet size 512 bytesMAC protocol IEEE 80211Transmission range 250mBandwidth 2MbpsQueue size 50 packetsMobility model Random waypoint modelTransmission power 0667WReceiving power 0365WIdle power 01WMaximum speed 5 10 15 20 25
50 100 150 20020
30
40
50
60
70
80
90
100
Number of nodes
Aver
age C
DS
size
Wu-CDSMaxS-CDS
Ours
Figure 2 Average size of CDS
The experiments are repeated for 50 trials with differentnetwork sizes and speeds of mobile nodes The experimentalconfiguration is listed as follows a rectangular grid of rangingfrom 5lowast5 to 1000lowast1000m2 and 5ndash200 points are distributedrandomly over the grid The other parameters are listed asshown in Table 1
52 Result Analysis The average CDS size with varyingnetwork sizes is shown in Figure 2 The average CDS sizeof SoN-MCDS is smaller than MaxS-CDS [18] thanks tointegrating three factors of energy mobility and degree Butour result is larger than Wu-CDS [3] The cause is that onlythe uncovered neighbors of the largest degree are selected asthe virtual backbone with the algorithm of Wu-CDS
The average route lengthwith increasing number of nodesis depicted in Figure 3 As expected the higher the CDS sizethe shorter the route length
The total energy consumed with different maximumspeed with increasing number of nodes is shown in Figure 4
40 60 80 100 120 140 160 180 200 2202
3
4
5
6
7
8
9
10
Number of nodes
Aver
age r
oute
leng
th
Wu-CDSMaxS-CDS
Ours
Figure 3 Average route length
5 10 15 20 2515
20
25
30
35
40
45
Maximum speed (ms)
AODVWu-CDS
MaxS-CDSOurs
Aver
age c
onsu
med
lowast102
(J)
Figure 4 The total energy consumed with different maximumspeed
With the increasing node speed the existing path may befrequently damaged So another CDS must be constructedby consuming more energy Therefore our algorithm onlyconsiders the nodes moving slowly to be the backbone ofnetwork so that the constructed CDS with our methodis more stable and the risk of reconstructing operations isreduced
Note that although the algorithm ofWU-CDS gets a goodresult ofminimum size CDS it does not guarantee an optimalnetwork performance The total energy consumption of theprotocols increases with the increasing node speed
The lifetime of network with increasing number of nodesis illustrated in Figure 5 Obviously our result shows that thenodes with more residual energy are selected as backbone
6 International Journal of Distributed Sensor Networks
50 100 150 200
40
60
80
100
120
140
160
180
Number of nodes
Num
ber o
f rou
nds
AODVMaxS-CDS
Ours
Figure 5 Average lifetime of network
nodes As a consequence the lifetime of the network canbe prolonged significantly That is the survival time can beprolonged in emergency situations to provide more opportu-nities for the rescue
6 Conclusion
In this paper we propose an energy efficient protocol to usea stable path for routing and prolong lifetime of MANETTheproposed protocol forms SoN-MCDS to do the broadcastand data transmission considering three factors of energymovements and degree of nodes Simulation results showthat our work is superior to other methods
Conflict of Interests
The authors declare that there is no conflict of interestsregarding the publication of this paper
Acknowledgments
This work was supported by GRRC program of GyeonggiProvince [(GRRCSUWON2014-B1)Cooperative Recognitionand Response System Based on Tension Sensing] and alsosupported by Shandong Provincial Natural Science Founda-tion (ZR2014FL022) China
References
[1] H-C Jang Y-N Lien and T-C Tsai ldquoRescue informationsystem for earthquake disasters based on MANET emer-gency communication platformrdquo in Proceedings of the ACMInternational Wireless Communications and Mobile ComputingConference (IWCMC rsquo09) pp 623ndash627 Leipzig Germany June2009
[2] A Ephremides J E Wieselthier and D J Baker ldquoA designconcept for reliable mobile radio networks with frequency
hopping signalingrdquo Proceedings of the IEEE vol 75 no 1 pp56ndash73 1987
[3] B N Clark C J Colbourn and D Johnson ldquoUnit disk graphsrdquoDiscrete Mathematics vol 86 no 1ndash3 pp 165ndash177 1990
[4] C Zheng S-X Sun andT-YHuang ldquoConstructing distributedconnected dominating sets in wireless ad hoc and sensornetworksrdquo Journal of Software vol 22 no 5 pp 1053ndash1066 2011
[5] F Dai and J Wu ldquoAn extended localized algorithm for con-nected dominating set formation in ad hoc wireless networksrdquoIEEE Transactions on Parallel and Distributed Systems vol 15no 10 pp 908ndash920 2004
[6] P-JWan KM Alzoubi and O Frieder ldquoDistributed construc-tion of connected dominating set in wireless AdHoc networksrdquoMobile Networks and Applications vol 9 no 2 pp 141ndash1492004
[7] Y LiM TThai FWang C-W Yi P-JWan andD-Z Du ldquoOngreedy construction of connected dominating sets in wirelessnetworksrdquo Wireless Communications and Mobile Computingvol 5 no 8 pp 927ndash932 2005
[8] L Wang and Y Xiao ldquoA survey of energy-efficient schedulingmechanisms in sensor networksrdquo Mobile Networks and Appli-cations vol 11 no 5 pp 723ndash740 2006
[9] K K Shukla and S Sah ldquoConstruction and maintenance ofvirtual backbone in wireless networksrdquo Wireless Networks vol19 no 5 pp 969ndash984 2013
[10] F Wang M Min Y Li and D Du ldquoOn the construction ofstable virtual backbones in mobile ad-hoc networksrdquo in Pro-ceedings of the 24th IEEE International Performance Computingand Communications Conference (IPCCC rsquo05) pp 355ndash362April 2005
[11] P-R SheuH-Y Tsai Y-P Lee and J-Y Cheng ldquoOn calculatingstable connected dominating sets based on link stability formobile ad hoc networksrdquo Tamkang Journal of Science andEngineering vol 12 no 4 pp 417ndash428 2009
[12] J Wu F Dai M Gao and I Stojmenovic ldquoOn calculatingpower-aware connected dominating sets for efficient routingin ad hoc wireless networksrdquo Journal of Communications andNetworks vol 4 no 1 pp 59ndash70 2002
[13] R Ramalakshmi and S Radhakrishnan ldquoImproving routediscovery using stable connected dominating set in MANETSrdquoInternational Journal onApplications ofGraphTheory inWirelessAd Hoc Networks and Sensor Networks vol 4 no 1 pp 15ndash252012
[14] T A Ramrekha V N Talooki J Rodriguez and C PolitisldquoEnergy efficient and scalable routing protocol for extremeemergency ad hoc communicationsrdquo Mobile Networks andApplications vol 17 no 2 pp 312ndash324 2012
[15] R Yu X Wang Y Liu and S K Das ldquoEnergy-efficientdominating tree construction in wireless ad hoc and sensornetworksrdquo in Distributed Computing and Networking pp 558ndash569 Springer Berlin Germany 2008
[16] B An and S Papavassiliou ldquoA mobility-based clusteringapproach to support mobility management and multicast rout-ing in mobile ad-hoc wireless networksrdquo International Journalof Network Management vol 11 no 6 pp 387ndash395 2001
[17] F Wang M Min Y Li and D Du ldquoOn the constructionof stable virtual backbones in mobile ad-hoc networksrdquo inProceedings for the 24th IEEE International Performance Com-puting and Communications Conference (IPCCC rsquo05) pp 355ndash362 April 2005
International Journal of Distributed Sensor Networks 7
[18] S Revathi and T R Rangaswamy ldquoEfficient flooding and localroute repair using stable connected dominating set for mobilead hoc networksrdquo Asian Journal of Scientific Research vol 7 no1 pp 102ndash109 2014
[19] Y-L Chang and C-C Hsu ldquoRouting in wirelessmobile ad-hocnetworks via dynamic group constructionrdquo Mobile Networksand Applications vol 5 no 1 pp 27ndash37 2000
International Journal of Distributed Sensor Networks 5
Table 1
Parameter ValueArea size 1000lowast 1000m2
Traffic type Constant bit rate (CBR)Packet size 512 bytesMAC protocol IEEE 80211Transmission range 250mBandwidth 2MbpsQueue size 50 packetsMobility model Random waypoint modelTransmission power 0667WReceiving power 0365WIdle power 01WMaximum speed 5 10 15 20 25
50 100 150 20020
30
40
50
60
70
80
90
100
Number of nodes
Aver
age C
DS
size
Wu-CDSMaxS-CDS
Ours
Figure 2 Average size of CDS
The experiments are repeated for 50 trials with differentnetwork sizes and speeds of mobile nodes The experimentalconfiguration is listed as follows a rectangular grid of rangingfrom 5lowast5 to 1000lowast1000m2 and 5ndash200 points are distributedrandomly over the grid The other parameters are listed asshown in Table 1
52 Result Analysis The average CDS size with varyingnetwork sizes is shown in Figure 2 The average CDS sizeof SoN-MCDS is smaller than MaxS-CDS [18] thanks tointegrating three factors of energy mobility and degree Butour result is larger than Wu-CDS [3] The cause is that onlythe uncovered neighbors of the largest degree are selected asthe virtual backbone with the algorithm of Wu-CDS
The average route lengthwith increasing number of nodesis depicted in Figure 3 As expected the higher the CDS sizethe shorter the route length
The total energy consumed with different maximumspeed with increasing number of nodes is shown in Figure 4
40 60 80 100 120 140 160 180 200 2202
3
4
5
6
7
8
9
10
Number of nodes
Aver
age r
oute
leng
th
Wu-CDSMaxS-CDS
Ours
Figure 3 Average route length
5 10 15 20 2515
20
25
30
35
40
45
Maximum speed (ms)
AODVWu-CDS
MaxS-CDSOurs
Aver
age c
onsu
med
lowast102
(J)
Figure 4 The total energy consumed with different maximumspeed
With the increasing node speed the existing path may befrequently damaged So another CDS must be constructedby consuming more energy Therefore our algorithm onlyconsiders the nodes moving slowly to be the backbone ofnetwork so that the constructed CDS with our methodis more stable and the risk of reconstructing operations isreduced
Note that although the algorithm ofWU-CDS gets a goodresult ofminimum size CDS it does not guarantee an optimalnetwork performance The total energy consumption of theprotocols increases with the increasing node speed
The lifetime of network with increasing number of nodesis illustrated in Figure 5 Obviously our result shows that thenodes with more residual energy are selected as backbone
6 International Journal of Distributed Sensor Networks
50 100 150 200
40
60
80
100
120
140
160
180
Number of nodes
Num
ber o
f rou
nds
AODVMaxS-CDS
Ours
Figure 5 Average lifetime of network
nodes As a consequence the lifetime of the network canbe prolonged significantly That is the survival time can beprolonged in emergency situations to provide more opportu-nities for the rescue
6 Conclusion
In this paper we propose an energy efficient protocol to usea stable path for routing and prolong lifetime of MANETTheproposed protocol forms SoN-MCDS to do the broadcastand data transmission considering three factors of energymovements and degree of nodes Simulation results showthat our work is superior to other methods
Conflict of Interests
The authors declare that there is no conflict of interestsregarding the publication of this paper
Acknowledgments
This work was supported by GRRC program of GyeonggiProvince [(GRRCSUWON2014-B1)Cooperative Recognitionand Response System Based on Tension Sensing] and alsosupported by Shandong Provincial Natural Science Founda-tion (ZR2014FL022) China
References
[1] H-C Jang Y-N Lien and T-C Tsai ldquoRescue informationsystem for earthquake disasters based on MANET emer-gency communication platformrdquo in Proceedings of the ACMInternational Wireless Communications and Mobile ComputingConference (IWCMC rsquo09) pp 623ndash627 Leipzig Germany June2009
[2] A Ephremides J E Wieselthier and D J Baker ldquoA designconcept for reliable mobile radio networks with frequency
hopping signalingrdquo Proceedings of the IEEE vol 75 no 1 pp56ndash73 1987
[3] B N Clark C J Colbourn and D Johnson ldquoUnit disk graphsrdquoDiscrete Mathematics vol 86 no 1ndash3 pp 165ndash177 1990
[4] C Zheng S-X Sun andT-YHuang ldquoConstructing distributedconnected dominating sets in wireless ad hoc and sensornetworksrdquo Journal of Software vol 22 no 5 pp 1053ndash1066 2011
[5] F Dai and J Wu ldquoAn extended localized algorithm for con-nected dominating set formation in ad hoc wireless networksrdquoIEEE Transactions on Parallel and Distributed Systems vol 15no 10 pp 908ndash920 2004
[6] P-JWan KM Alzoubi and O Frieder ldquoDistributed construc-tion of connected dominating set in wireless AdHoc networksrdquoMobile Networks and Applications vol 9 no 2 pp 141ndash1492004
[7] Y LiM TThai FWang C-W Yi P-JWan andD-Z Du ldquoOngreedy construction of connected dominating sets in wirelessnetworksrdquo Wireless Communications and Mobile Computingvol 5 no 8 pp 927ndash932 2005
[8] L Wang and Y Xiao ldquoA survey of energy-efficient schedulingmechanisms in sensor networksrdquo Mobile Networks and Appli-cations vol 11 no 5 pp 723ndash740 2006
[9] K K Shukla and S Sah ldquoConstruction and maintenance ofvirtual backbone in wireless networksrdquo Wireless Networks vol19 no 5 pp 969ndash984 2013
[10] F Wang M Min Y Li and D Du ldquoOn the construction ofstable virtual backbones in mobile ad-hoc networksrdquo in Pro-ceedings of the 24th IEEE International Performance Computingand Communications Conference (IPCCC rsquo05) pp 355ndash362April 2005
[11] P-R SheuH-Y Tsai Y-P Lee and J-Y Cheng ldquoOn calculatingstable connected dominating sets based on link stability formobile ad hoc networksrdquo Tamkang Journal of Science andEngineering vol 12 no 4 pp 417ndash428 2009
[12] J Wu F Dai M Gao and I Stojmenovic ldquoOn calculatingpower-aware connected dominating sets for efficient routingin ad hoc wireless networksrdquo Journal of Communications andNetworks vol 4 no 1 pp 59ndash70 2002
[13] R Ramalakshmi and S Radhakrishnan ldquoImproving routediscovery using stable connected dominating set in MANETSrdquoInternational Journal onApplications ofGraphTheory inWirelessAd Hoc Networks and Sensor Networks vol 4 no 1 pp 15ndash252012
[14] T A Ramrekha V N Talooki J Rodriguez and C PolitisldquoEnergy efficient and scalable routing protocol for extremeemergency ad hoc communicationsrdquo Mobile Networks andApplications vol 17 no 2 pp 312ndash324 2012
[15] R Yu X Wang Y Liu and S K Das ldquoEnergy-efficientdominating tree construction in wireless ad hoc and sensornetworksrdquo in Distributed Computing and Networking pp 558ndash569 Springer Berlin Germany 2008
[16] B An and S Papavassiliou ldquoA mobility-based clusteringapproach to support mobility management and multicast rout-ing in mobile ad-hoc wireless networksrdquo International Journalof Network Management vol 11 no 6 pp 387ndash395 2001
[17] F Wang M Min Y Li and D Du ldquoOn the constructionof stable virtual backbones in mobile ad-hoc networksrdquo inProceedings for the 24th IEEE International Performance Com-puting and Communications Conference (IPCCC rsquo05) pp 355ndash362 April 2005
International Journal of Distributed Sensor Networks 7
[18] S Revathi and T R Rangaswamy ldquoEfficient flooding and localroute repair using stable connected dominating set for mobilead hoc networksrdquo Asian Journal of Scientific Research vol 7 no1 pp 102ndash109 2014
[19] Y-L Chang and C-C Hsu ldquoRouting in wirelessmobile ad-hocnetworks via dynamic group constructionrdquo Mobile Networksand Applications vol 5 no 1 pp 27ndash37 2000
6 International Journal of Distributed Sensor Networks
50 100 150 200
40
60
80
100
120
140
160
180
Number of nodes
Num
ber o
f rou
nds
AODVMaxS-CDS
Ours
Figure 5 Average lifetime of network
nodes As a consequence the lifetime of the network canbe prolonged significantly That is the survival time can beprolonged in emergency situations to provide more opportu-nities for the rescue
6 Conclusion
In this paper we propose an energy efficient protocol to usea stable path for routing and prolong lifetime of MANETTheproposed protocol forms SoN-MCDS to do the broadcastand data transmission considering three factors of energymovements and degree of nodes Simulation results showthat our work is superior to other methods
Conflict of Interests
The authors declare that there is no conflict of interestsregarding the publication of this paper
Acknowledgments
This work was supported by GRRC program of GyeonggiProvince [(GRRCSUWON2014-B1)Cooperative Recognitionand Response System Based on Tension Sensing] and alsosupported by Shandong Provincial Natural Science Founda-tion (ZR2014FL022) China
References
[1] H-C Jang Y-N Lien and T-C Tsai ldquoRescue informationsystem for earthquake disasters based on MANET emer-gency communication platformrdquo in Proceedings of the ACMInternational Wireless Communications and Mobile ComputingConference (IWCMC rsquo09) pp 623ndash627 Leipzig Germany June2009
[2] A Ephremides J E Wieselthier and D J Baker ldquoA designconcept for reliable mobile radio networks with frequency
hopping signalingrdquo Proceedings of the IEEE vol 75 no 1 pp56ndash73 1987
[3] B N Clark C J Colbourn and D Johnson ldquoUnit disk graphsrdquoDiscrete Mathematics vol 86 no 1ndash3 pp 165ndash177 1990
[4] C Zheng S-X Sun andT-YHuang ldquoConstructing distributedconnected dominating sets in wireless ad hoc and sensornetworksrdquo Journal of Software vol 22 no 5 pp 1053ndash1066 2011
[5] F Dai and J Wu ldquoAn extended localized algorithm for con-nected dominating set formation in ad hoc wireless networksrdquoIEEE Transactions on Parallel and Distributed Systems vol 15no 10 pp 908ndash920 2004
[6] P-JWan KM Alzoubi and O Frieder ldquoDistributed construc-tion of connected dominating set in wireless AdHoc networksrdquoMobile Networks and Applications vol 9 no 2 pp 141ndash1492004
[7] Y LiM TThai FWang C-W Yi P-JWan andD-Z Du ldquoOngreedy construction of connected dominating sets in wirelessnetworksrdquo Wireless Communications and Mobile Computingvol 5 no 8 pp 927ndash932 2005
[8] L Wang and Y Xiao ldquoA survey of energy-efficient schedulingmechanisms in sensor networksrdquo Mobile Networks and Appli-cations vol 11 no 5 pp 723ndash740 2006
[9] K K Shukla and S Sah ldquoConstruction and maintenance ofvirtual backbone in wireless networksrdquo Wireless Networks vol19 no 5 pp 969ndash984 2013
[10] F Wang M Min Y Li and D Du ldquoOn the construction ofstable virtual backbones in mobile ad-hoc networksrdquo in Pro-ceedings of the 24th IEEE International Performance Computingand Communications Conference (IPCCC rsquo05) pp 355ndash362April 2005
[11] P-R SheuH-Y Tsai Y-P Lee and J-Y Cheng ldquoOn calculatingstable connected dominating sets based on link stability formobile ad hoc networksrdquo Tamkang Journal of Science andEngineering vol 12 no 4 pp 417ndash428 2009
[12] J Wu F Dai M Gao and I Stojmenovic ldquoOn calculatingpower-aware connected dominating sets for efficient routingin ad hoc wireless networksrdquo Journal of Communications andNetworks vol 4 no 1 pp 59ndash70 2002
[13] R Ramalakshmi and S Radhakrishnan ldquoImproving routediscovery using stable connected dominating set in MANETSrdquoInternational Journal onApplications ofGraphTheory inWirelessAd Hoc Networks and Sensor Networks vol 4 no 1 pp 15ndash252012
[14] T A Ramrekha V N Talooki J Rodriguez and C PolitisldquoEnergy efficient and scalable routing protocol for extremeemergency ad hoc communicationsrdquo Mobile Networks andApplications vol 17 no 2 pp 312ndash324 2012
[15] R Yu X Wang Y Liu and S K Das ldquoEnergy-efficientdominating tree construction in wireless ad hoc and sensornetworksrdquo in Distributed Computing and Networking pp 558ndash569 Springer Berlin Germany 2008
[16] B An and S Papavassiliou ldquoA mobility-based clusteringapproach to support mobility management and multicast rout-ing in mobile ad-hoc wireless networksrdquo International Journalof Network Management vol 11 no 6 pp 387ndash395 2001
[17] F Wang M Min Y Li and D Du ldquoOn the constructionof stable virtual backbones in mobile ad-hoc networksrdquo inProceedings for the 24th IEEE International Performance Com-puting and Communications Conference (IPCCC rsquo05) pp 355ndash362 April 2005
International Journal of Distributed Sensor Networks 7
[18] S Revathi and T R Rangaswamy ldquoEfficient flooding and localroute repair using stable connected dominating set for mobilead hoc networksrdquo Asian Journal of Scientific Research vol 7 no1 pp 102ndash109 2014
[19] Y-L Chang and C-C Hsu ldquoRouting in wirelessmobile ad-hocnetworks via dynamic group constructionrdquo Mobile Networksand Applications vol 5 no 1 pp 27ndash37 2000
International Journal of Distributed Sensor Networks 7
[18] S Revathi and T R Rangaswamy ldquoEfficient flooding and localroute repair using stable connected dominating set for mobilead hoc networksrdquo Asian Journal of Scientific Research vol 7 no1 pp 102ndash109 2014
[19] Y-L Chang and C-C Hsu ldquoRouting in wirelessmobile ad-hocnetworks via dynamic group constructionrdquo Mobile Networksand Applications vol 5 no 1 pp 27ndash37 2000
