Binary Tree Routing for Parallel Data Gathering in Sensor Networks of Smart Home
|
|
- Mitchell Patrick
- 5 years ago
- Views:
Transcription
1 Binary Tree Routing for Parallel Data Gathering in Sensor etworks of Smart Home Guangyan Huang and Xiaowei Li Jing He Advanced Test Technology Lab. Chinese Academy of Sciences Research Center on Data Institute of Computing Technology, Technology and Knowledge conomy Chinese Academy of Sciences 18 Beijing, China 18 Beijing, China {huanggy, Abstract With advances in consumer electronics and wireless communications, wireless sensors will be placed everywhere in future s smart home to provide the safety and convenience for consumers. A PC connected with a Base Station (BS) will work as a control center for gathering and handling the data sensed from physic environment in the home. Because of the network area of approximately 2m 2m in the home, transmitting distance is no longer important. Directly transmitting data to BS consumes less energy than any other energy-efficient protocols. However, high delay is one of the most important problems produced by direct transmitting. This paper proposes Binary Tree Routing Protocol (BTRP) to reduce delay in the networks of smart home. BTRP is proved to be the optimal tree routing protocol by evaluating the performance of the networks with energy delay metric. Simulation results show BTRP outperforms traditional direct routing and two-hop routing in terms of lifetime/delay metric. I. ITRODUCTIO With advances in consumer electronics and wireless communications, wireless sensors will be placed everywhere in future s smart home [1]. For example, sensors are deployed for hazards detection [2] such as fire-detection, intruder-detection, etc., and for automation control [1] such as collecting information of temperature, humidity and light for related electronic devices. A PC connected with a Base Station (BS) will work as a control centre for gathering and handling the data messages sensed from physic environment in the home. The sensor networks of smart home show a kind of network scenario with a very high density of sensors deployed in a small area of approximately 2m 2m. Directly transmitting data to BS consumes less energy than any other energy-efficient protocols. However, several issues such as high delay and interference [3] produced by direct routing must be resolved. To reduce delay costs, parallel data gathering can be achieved for time efficiency by organizing sensors as a tree with many hops to transmit data to BS instead of one hop transmitting in direct routing. To alleviate interference, good transmitting scheduling must be adopted. However, multi-hop schemes would incur more energy dissipation than direct routing in the networks of smart home. Because handling 1-bit data on MCU dissipates far less energy than transmitting 1-bit data on radio module [4], reducing the amount of data transmitted between sensor nodes and BS by combining one or more packets to produce a same-size resultant packet may be a good solution for energy efficiency [5]. This means source data messages such as temperature, light, the quantity of smoke, etc. sensed by wireless sensors can be aggregated partly and be gotten rid of redundancy or compressed to a small number. Although they have only limited computing ability, wireless sensors can do the above computing jobs to get maximum network efficiency. This paper proposes Binary Tree Routing Protocol (BTRP) for the networks of smart home. Proofs are given to demonstrate that BTRP is the best one among all n-tree multihop routings. An algorithm of generating binary tree and an algorithm of parallel tree scheduling are given. The energy delay metric [5] is captured to balance the energy dissipation and delay cost for parallel data gathering in BTRP. Simulation also shows BTRP outperforms traditional direct routing and two-hop routing. The rest of this paper is organized as follows. Section II introduces backgrounds. Section III applies simple two-hop routing to the networks of smart home. Section IV provides general n-tree multi-hop routing schemes and proves binary tree is one of the optimal tree routing protocols. Section V simulates the results of BTRP in the networks of smart home and shows the better lifetime/delay metric in BTRP than in direct and two-hop routing. Section VI concludes that BTRP is the elegant solution for the networks of smart home. II. BACKGROUDS In this paper, using the same first order radio model as discussed in [6], a radio dissipates elec = 5nJ / bit to run the 2 transmitter or receiver circuitry and ε FS = 1 pj / bit / m for the transmitter amplifier, the energy dissipation, T ( k, d), of transmitting k-bit data between two nodes separated by a distance of d meters is given as follows: T 2 ( k, d) = k( + ε d ). (1) elec FS And the energy cost, R (k), incurred in the receiver of the destination sensor node is given as follows: ( k) =. (2) R k elec In the networks of smart home ( d < 2 2 = 28. 8m ) the energy spent in the electronics part is nearly 6 times more than the maximum energy spent in the amplifier part. Therefore, multi-hop can spend far more energy than direct transmitting on receiving and mid-transmitting data. A simple scheme is one hop routing or direct routing (Direct) which lets each sensor directly send source data message to BS. As the above energy analysis, the farthest sensors drain their energy resource at almost the same time as
2 the nearest sensors do. Therefore, energy efficiency of routing scheme is less important in the networks of smart home than in larger wireless sensor networks. However, one BS for receiving the data of all sensors serially makes high delay. We assume that the delay is one unit for a packet message transmitted [5]. In one hop routing, the value of delay metric is the number of sensors in the networks of smart home. For example, on a 2Mbps link, a 2,-bit message can be transmitted in 1ms, and suppose 2 sensors deployed in the networks of smart home and each has a packet of 2,-bit to be transmitted in each round, the delay time is 2s. Therefore, some sensors should help to handle or fuse some sensed data for reducing the delay of BS. One of the two-hop routing protocols is provided by Low nergy Adaptive Clustering Hierarchy (LACH) [6], which chooses some sensors as Cluster Heads (CHs) to help fuse data. In LACH, several nodes are randomly chosen as CHs dynamically in each round, then the remaining nodes are affiliated to the nearest CHs based on received signal strength by a distributed algorithm, and at last CHs transmit all data message to BS. Applying LACH to the networks of smart home, BS is within the network area and thus no optimal number of CHs for energy efficiency. The main purpose of using LACH is to reduce delay. III. TWO-HOP LOW DLAY ROUTIG PROTOCOL The routing scheme adopted in the networks of smart home must be useful to get less delay costs and to evenly distributing the energy dissipation. Improved LACH for the networks of smart home named Two-Hop Low Delay routing protocol (THLD) is provided in this paper. THLD is a simple routing scheme to reduce delay of the networks but to introduce small extra energy dissipation. Firstly, THLD makes parallel communication possible and thus reduces the delay costs. Moreover, THLD distributes data to be handled by different CHs in different round, and thus evenly distributes the energy dissipation among all sensors. A. Delay Analysis in THLD THLD provided by this paper adopts the club-club twohop topology. However, THLD minimizes delay in the networks of smart home networks. Suppose the number of sensors is and all sensors are grouped into CH clusters, the delay cost, C, will be given as follows: CH delay C delay = + CH. (3) We can find the optimum number of clusters by setting the derivative of C delay with respect to CH to zero as follows: opt. (4) CH = Moreover, the number of sensors in each cluster is also. Thus the minimal delay cost of THLD is as follows: C delay = 2. (5) B. venly Distributing of nergy Dissipation Two-hop brings the problem that some sensors as the midtransmitters die long before the others. In one hop routing, the i-th sensor dissipates energy of transmitting k-bit data, T ( k, d i ). In two-hop routing, the j-th CH dissipates energy of CH = k + 1) elec + FS d 2 j ) + k1 bit (( ε (6) where 1 bit is the energy dissipation of fusing 1-bit data. Given 1 bit = 5nJ / bit, =1, and neglecting energy spent in the amplifier part, CHs consume approximately 11 times more energy than non-ch sensors. Therefore, positions of CHs should be evenly distributed into all the sensors. The average energy dissipation of electronics part for k-bit data can be given as follows: 1 ) total elec = k( 2 elec. (7) df The average energy dissipation of data fusion for k-bit is = k1. (8) bit BS is placed in the centre of the smart home. The average transmitting distance between sensors and their CHs is also non-significant. Fig. 1 plots that the average energy dissipation of amplifier part on each node during each round can be neglected, because the energy dissipation of electronics part is nearly several hundreds times of it. Therefore, all the two hoprouting schemes for energy efficiency in the networks of smart home are not better than direct routing. Average nergy Dissipation of Amplifier Part (nj) Direct THLD Fig. 1. Average energy dissipation of amplifier part on transmission of 1-bit data. Compared with the energy spent in the electronics part for 1-bit data, 5 nj in Direct and approximately 1 nj in THLD, the energy dissipation on amplifier part is far less and thus can be neglected. Suppose all the sensors have the same initial energy resource. The algorithm of evenly distributing energy dissipation in THLD is given as follows: Step 1. Choose sensors with maximum energy resource as CHs. If p sensors have the same energy resources and q sensors have been chosen, then x sensors are randomly chosen as CHs, where x p. If p + q, then x = p, else x = q.
3 Step 2. Sensors with lower energy resource will firstly be affiliated into a nearest CH and just sensors are in each cluster. The number of sensors in the last cluster may be less than. Fig. 2 shows the average energy dissipation in THLD is approximately two times of that in direct routing. However, energy delay metric in THLD is reduced greatly compared with direct routing. Using (5), delay of THLD reduces to 16, 2, 26, 3, 32, 36, 38, 4, 44 and 46 in networks varying from 5 to 5 sensors by the costs of consuming approximately one time more energy. Thus, the values of energy delay in THLD are reduced to approximately 64%, 4%, 34.7%, 3%, 25.6%, 24%, 21.7%, 2%, 19.6% and 18.4% of direct routing respectively. Average nergy Dissipation of etwork (nj) Direct THLD Fig. 2. Average energy dissipation of networks in each round. THLD provides the improvement direction of routing protocols in the networks of smart home. Because energy dissipations of amplifier part are far less than electronic part in the networks of smart home and also data fusion reduces the amount of data greatly, the key problem of energy efficiency is changed into not only reduce the total energy dissipation of the networks but also evenly distribute the energy to all the nodes. Distance is not as important in home networks as in outdoor networks with long transmitting distance. IV. OPTIMAL TR ROUTIG PROTOCOLS General n-tree should be analyzed by using energy delay metric for finding the optimal one with the lowest energy dissipation and lowest delay of the whole sensor networks. Also, sensors with the lowest energy resource should be the key pivots to distribute the energy dissipation. A. Optimal Delay Analysis Suppose sensors deployed in the networks of smart home. Optimal delay can be obtained by connecting sensors with suitable depth, h, and suitable number of divarication, n, of the tree topology. In a binary-tree, namely n=2, firstly half of the leaf nodes can send their data by parallel transmission in each round, then the leaf of the remaining tree (excluding the latest leaf nodes) send data and repeat until all the nodes except the root have sent their data. In an n-tree, 1/n of the leaf nodes can send their data simultaneously in each round and the remaining operations are finished by the same method as the binary-tree. Suppose the first level of the tree is connected directly to the root, the leaf nodes are at the h-th level, n delay would be made by each level s transmission and n i sensors can send data by parallel transmission at the i-th level. Thus, the total delay of an n-tree is given as follows: C delay = h n. (9) is given as follows: = 1+ n + n n h h+ 1 Using (9) and (1), the delay is as follows: n 1 = 1. (1) n 1 ln( n + n) C delay = ( 1) n. (11) ln n Some examples of (11) are shown in Fig. 3. Delay =1 =5 =4 =3 = n -tree Fig. 3. Delay varies with general n-tree by setting =1, 2, 3, 4, 5, and the minimal delays are 12, 14, 15, 16 and 16 respectively with n=2 or 3. B. Analysis of energy delay Metric Generally, the total energy dissipation of the networks is given as follows: network = T ( k, d ) + n( leaf ) ( n + 1)( ) ( k) leaf df R ( k) + (12) where d is the average transmitting distance of each sensors and is the number of leaf nodes in the n-tree. leaf h n n + n h 1 leaf = + n = + 1 n. (13) n Using (1), we give the depth of the n-tree as follows: ln( n + n) h = 1. (14) ln n Using (11)-(14), we calculate the value of energy delay metric as follows:
4 f ( n, ) = C delay nk(ln( n + n) / ln network = n 1)((15 + (15) + 5 / n) 55n 5) where is the average energy dissipation of amplifier part varying with in Fig. 1. If is given, the minimal value of f ( n, ) is determined by both and n for the routing problem in the networks of smart home. Fig. 4 shows the energy dissipations are changed slightly with the value of n. However, Fig. 3 plots the optimal delay costs are achieved with n=2 or 3. Average nergy Dissipation of ach Round n -tree =5 =4 =3 =2 =1 Fig. 4. Average energy dissipation varies with n-tree. Using (12)-(14), average energy dissipation of networks in each round with k=1 bit is plotted and is only affected by n slightly. Fig. 5 plots the value of energy delay metric varies with n. It shows that binary tree is the best solution for =2, 4 and 5 and 3-tree is the best solution for =1 and 3. Because the performances of both binary tree and 3-tree are nearly the same, we adopt binary tree routing in this paper. energy delay n -tree Fig. 5. Metric of energy delay varies with general n-tree. =5 =4 =3 =2 =1 C. Binary Tree Routing Protocol (1) Build Binary Tree for venly Distributing the nergy Dissipation In Binary Tree Routing Protocol (BTRP), suppose BS knows the energy resource of all sensors in each round and n=2. This paper gives the algorithm of generating n-tree by BS with the following steps. This is a general algorithm and n can be an arbitrary integer greater than 1. Step 1. Choose leaf sensors with minimal energy resource as leaf nodes of the tree. Step 2. Given n leaf nodes with the 2-dimensional coordinates as (x 1, y 1 ), (x 2, y 2 ), (x n, y n ), let x1 + x xn y1 + y yn x = and y =. The father n n node of the n leaf nodes is the sensor whose coordinate is closest to ( x, y ). h ( n 1) n + n Step 3. Find F = father sensors of the n( n 1) h -th level of the tree by using the method in Step 2, and let i = h 1. Step 4. Find n i father nodes of the nodes at the i-th level of the tree by using the method in Step 2. Step 5. Let i = i 1, repeat Step 4 until i = 1, and then stop. (2) Parallel Transmission Scheduling of Binary Tree Routing Suppose all nodes use CDMA [7] to avoid collisions. Thus some nodes in a cluster can transmit data simultaneously. Thus parallel transmission scheduling of BTRP offers advantages of reducing delay and interference. This paper provides binary tree routing scheduling algorithm to generate the parallel transmission sets of sensors as follows. Step 1. Let i = h. The initial operation set is L = leaf nodes in the i-th level of the binary tree. Step 2. Place L nodes into set R. Split R into R1 and R2 by satisfying that both x1 and x2 have the same father and at the same time they are in the different sets, where both x1 and x2 are arbitrary different elements in R. Step 3. All nodes in R1 (or R2) transmit their data simultaneously. Thus it costs 2 delays to transmit data in R. Step 4. If i >, the operation set is L = n nodes of the (i- 1)-th level in the binary tree. Then let i = i 1 and go to Step 2. Otherwise, stop. Sensors in the same sets can send data to their father simultaneously. The main idea of this algorithm is to place the sensors, who have no more data needed be collected on their sons (if they have any) in the current round and never have the same father, into the same parallel transmission set. V. PRFORMAC OF BTRP xperiments are done to evaluate the performance of BTRP. Parameters of energy dissipation for radio and data fusion are given in Section II and III. One packet includes 2, bits. etwork area is given as 2m 2m. The coordinate of BS is (1m, 1m). The precision of distance between any two sensors is given as decimeter (dm) because of the short distance in the networks of smart home. etwork lifetime is defined as the Time or rounds before the First sensor odes Dies (TFD). A new metric of lifetime/delay is used to clearly evaluate the total performance of the three routing protocols. Another new metric of the Ratio of TFD and TAD (RTT) is given to evaluate the evenly distributing of i
5 energy dissipation, where TAD is the Time or rounds before All sensor odes Die. Fig. 6 shows RTT metrics of Direct, THLD and BTRP vary with the number of sensors. BTRP performs well to evenly distribute the energy dissipation with RTT of more than 99%. Because BTRP chooses the sensors with less energy resource as leaf nodes of the binary tree, which consumes less energy for only transmitting data once in each round. THLD adopts another distributing scheme of choosing sensors with more energy resource as CHs to do the tasks that consume more energy. RTT even in Direct is reasonable in the networks of smart home. Both BTRP and THLD outperform Direct. And BTRP excels THLD in terms of RTT. RTT (%) Fig. 6. RTT for evaluating evenly distributing of energy dissipation. Simulations of the network lifetime (number of rounds) and delay of the three routing protocols show in Fig. 7 and Fig. 8 respectively. Fig. 8 shows both BTRP and THLD outperform Direct in terms of delay by introducing more energy dissipation costs shown in Fig. 7. Fig. 7 plots the lifetime of BTRP is not better than THLD. However, Fig. 8 shows BTRP performs better than THLD in terms of delay. example, the lifetime/delay metric in BTRP is 17.6%, 43.4% and 68.9% greater than that in THLD as well as 127%, and 431% greater than that in Direct in networks with 5, 1 and 15 sensors respectively. Delay lifetime / delay Fig. 8. Delay of each round Fig. 9. Metric of lifetime/delay varies with number of sensors. umber of Rounds VI. COCLUSIOS In the networks of smart home with area of 2m 2m, the routing protocols are provided for two goals: evenly distributing energy dissipation and reducing delay. This paper firstly applies THLD routing protocols to the networks of smart home. Then general n-tree multi-hop routing schemes are analyzed theoretically. Binary tree is proved to be the optimal tree routing by evaluating with energy delay metric. At last, RTT and lifetime/delay are used to evaluate the two goals above. xperiments shows BTRP outperforms the traditional Direct and THLD routing in terms of RTT and lifetime/delay. In a word, BTRP is an elegant solution for the networks of smart home. Fig. 7. etwork lifetime varies with the number of sensors. The total performance of the three routing protocols can be shown in Fig. 9 by the metric of lifetime/delay, which is the greater the better, because lifetime is the longer the better and delay is the shorter the better. Fig. 9 clearly plots BTRP excels both Direct and THLD in terms of lifetime/delay metric. For ACKOWLDGMT This work was supported in part by the ational Basic Research Program of China (o.25cb32164) and the ational atural Science Foundation of China (o.9272).
6 RFRCS [1] H. Oh, H. Bahn, and K.-J. Chae, An energy-efficient sensor routing scheme for home automation networks, I Transactions on Consumer lectronics, vol. 51, no. 3, pp , Aug. 25. [2] K. C. Lee and H.-H. Lee, etwork-based fire-detection system via controller area network for smart home automation, I Transactions on Consumer lectronics, vol. 5, no. 4, pp , ov. 24. [3] R. Kays, K. Jostschulte, and W. ndemann, Wireless Ad-hoc networks with high node density for home AV trasmission, I Transactions on Consumer lectronics, vol. 5, no. 2, pp , May 24. [4] J. Hill, R. Szewczyk, A. Woo, S. Hollar, D. Culler, and K. Pister, System architecture directions for networked sensors, In Proc. Architectural Support for Programming Languages and Operating Systems, 2, pp [5] S. Lindsey, C. Raghavendra and K. M. Sivalingam, Data gathering algorithms in sensor networks using energy metrics, I Transactions on Parallel and Distributed Systems, vol. 13, pp , Sep. 22. [6] W. B. Heinzelman, A. P. Chandrakasan, and H. Balakrishnan, An application-specific protocol architecture for wireless microsensor networks, I Transactions on Wireless Communications, vol. 1, pp , Oct. 22. [7] M. ttus. System capacity, latency, and power consumption in multihoprouted SS-CDMA wireless networks, in Proc. Radio and Wireless Conference, 1998, pp
Dynamic Minimal Spanning Tree Routing Protocol for Large Wireless Sensor Networks
Dynamic Minimal Spanning Tree Routing Protocol for Large Wireless Sensor Networks Guangyan Huang 1, Xiaowei Li 1, and Jing He 1 Advanced Test Technology Lab., Institute of Computing Technology, Chinese
More informationData Gathering in Sensor Networks using the Energy*Delay Metric
Data Gathering in Sensor Networks using the Energy*Delay Metric Stephanie Lindsey*+, Cauligi Raghavendra*, and Krishna Sivalingam+ *Computer Systems Research Department The Aerospace Corporation P. O.
More informationData Gathering in Sensor Networks using the Energy*Delay Metric. Stephanie Lindsey Cauligi Raghavendra Krishna Sivalingam
Data Gathering in Sensor Networks using the Energy*Delay Metric Stephanie Lindsey Cauligi Raghavendra Krishna Sivalingam Corresponding Author: Cauligi Raghavendra Computer Systems Research Department The
More informationPower Efficient Data Gathering and Aggregation in Wireless Sensor Networks
Power Efficient Data Gathering and Aggregation in Wireless Sensor Networks Hüseyin Özgür Tan and İbrahim Körpeoǧlu Department of Computer Engineering, Bilkent University 68 Ankara, Turkey E-mail:{hozgur,korpe}@cs.bilkent.edu.tr
More informationAmeliorate Threshold Distributed Energy Efficient Clustering Algorithm for Heterogeneous Wireless Sensor Networks
Vol. 5, No. 5, 214 Ameliorate Threshold Distributed Energy Efficient Clustering Algorithm for Heterogeneous Wireless Sensor Networks MOSTAFA BAGHOURI SAAD CHAKKOR ABDERRAHMANE HAJRAOUI Abstract Ameliorating
More informationROUTING ALGORITHMS Part 2: Data centric and hierarchical protocols
ROUTING ALGORITHMS Part 2: Data centric and hierarchical protocols 1 Negative Reinforcement Time out Explicitly degrade the path by re-sending interest with lower data rate. Source Gradient New Data Path
More informationNovel Cluster Based Routing Protocol in Wireless Sensor Networks
ISSN (Online): 1694-0784 ISSN (Print): 1694-0814 32 Novel Cluster Based Routing Protocol in Wireless Sensor Networks Bager Zarei 1, Mohammad Zeynali 2 and Vahid Majid Nezhad 3 1 Department of Computer
More informationIMPACT OF LEADER SELECTION STRATEGIES ON THE PEGASIS DATA GATHERING PROTOCOL FOR WIRELESS SENSOR NETWORKS
IMPACT OF LEADER SELECTION STRATEGIES ON THE PEGASIS DATA GATHERING PROTOCOL FOR WIRELESS SENSOR NETWORKS Indu Shukla, Natarajan Meghanathan Jackson State University, Jackson MS, USA indu.shukla@jsums.edu,
More informationEnhancement of Hierarchy Cluster-Tree Routing for Wireless Sensor Network
Enhancement of Hierarchy Cluster-Tree Routing for Wireless Sensor Network Xuxing Ding Tel: 86-553-388-3560 E-mail: dxx200@163.com Fangfang Xie Tel: 86-553-388-3560 E-mail: fangtinglei@yahoo.com.cn Qing
More informationHeterogeneous LEACH Protocol for Wireless Sensor Networks
Volume: 5 Issue: 1 Pages:1825-1829 (13) ISSN : 975-29 1825 Heterogeneous LEACH Protocol for Wireless Sensor Networks Nishi Sharma Department of Computer Science, Rajasthan Technical University Email: nishi.engg@gmail.com
More information924 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 13, NO. 9, SEPTEMBER 2002
924 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 13, NO. 9, SEPTEMBER 2002 Data Gathering Algorithms in Sensor Networks Using Energy Metrics Stephanie Lindsey, Cauligi Raghavendra, Fellow
More informationAn Energy Efficient Data Dissemination Algorithm for Wireless Sensor Networks
, pp.135-140 http://dx.doi.org/10.14257/astl.2014.48.22 An Energy Efficient Data Dissemination Algorithm for Wireless Sensor Networks Jin Wang 1, Bo Tang 1, Zhongqi Zhang 1, Jian Shen 1, Jeong-Uk Kim 2
More informationComparative Analysis of EDDEEC & Fuzzy Cost Based EDDEEC Protocol for WSNs
Comparative Analysis of EDDEEC & Fuzzy Cost Based EDDEEC Protocol for WSNs Baljinder Kaur 1 and Parveen Kakkar 2 1,2 Department of Computer Science & Engineering, DAV Institution of Engineering & Technology,
More information732 IEEE TRANSACTIONS ON NUCLEAR SCIENCE, VOL. 61, NO. 2, APRIL 2014
732 IEEE TRANSACTIONS ON NUCLEAR SCIENCE, VOL. 61, NO. 2, APRIL 2014 A General Self-Organized Tree-Based Energy-Balance Routing Protocol for Wireless Sensor Network Zhao Han, Jie Wu, Member, IEEE, Jie
More informationEnergy Enhanced Base Station Controlled Dynamic Clustering Protocol for Wireless Sensor Networks
Journal of Advances in Computer Networks, Vol. 1, No. 1, March 213 Energy Enhanced Base Station Controlled Dynamic Clustering Protocol for Wireless Sensor Networks K. Padmanabhan and P. Kamalakkannan consume
More informationImpact of Black Hole and Sink Hole Attacks on Routing Protocols for WSN
Impact of Black Hole and Sink Hole Attacks on Routing Protocols for WSN Padmalaya Nayak V. Bhavani B. Lavanya ABSTRACT With the drastic growth of Internet and VLSI design, applications of WSNs are increasing
More informationKeywords Wireless Sensor Network, Cluster, Energy Efficiency, Heterogeneous network, Cluster, Gateway
Energy Efficient (EEC) Clustered rotocol for Heterogeneous Wireless Sensor Network Surender Kumar Manish rateek Bharat Bhushan Department of Computer Engg Department of Computer Engg Department of Computer
More informationClustering Routing Protocol Based on Location Node in Wireless Sensor Networks
Clustering Routing Protocol Based on Location Node in Wireless Sensor Networks NURHAYATI, KYUNG OH LEE Department of Computer Science Sun Moon University Kalsan-ri, Tangjeong-myeon, Asan-si, Chungnam 336-708
More informationIntra and Inter Cluster Synchronization Scheme for Cluster Based Sensor Network
Intra and Inter Cluster Synchronization Scheme for Cluster Based Sensor Network V. Shunmuga Sundari 1, N. Mymoon Zuviria 2 1 Student, 2 Asisstant Professor, Computer Science and Engineering, National College
More informationAdapting Distance Based Clustering Concept to a Heterogeneous Network
International Journal of Computer Theory and Engineering, Vol. 7, No. 3, June 215 Adapting Distance Based Clustering Concept to a Heterogeneous Network N. Laloo, M. Z. A. A. Aungnoo, and M. S. Sunhaloo
More informationPower Aware Metrics for Wireless Sensor Networks
Power Aware Metrics for Wireless Sensor Networks Ayad Salhieh Department of ECE Wayne State University Detroit, MI 48202 ai4874@wayne.edu Loren Schwiebert Department of Computer Science Wayne State University
More informationPerformance of a Novel Energy-Efficient and Energy Awareness Scheme for Long-Lifetime Wireless Sensor Networks
Sensors and Materials, Vol. 27, No. 8 (2015) 697 708 MYU Tokyo S & M 1106 Performance of a Novel Energy-Efficient and Energy Awareness Scheme for Long-Lifetime Wireless Sensor Networks Tan-Hsu Tan 1, Neng-Chung
More informationModified Low Energy Adaptive Clustering Hierarchy for Heterogeneous Wireless Sensor Network
Modified Low Energy Adaptive Clustering Hierarchy for Heterogeneous Wireless Sensor Network C.Divya1, N.Krishnan2, A.Petchiammal3 Center for Information Technology and Engineering Manonmaniam Sundaranar
More informationEvaluation of Cartesian-based Routing Metrics for Wireless Sensor Networks
Evaluation of Cartesian-based Routing Metrics for Wireless Sensor Networks Ayad Salhieh Department of Electrical and Computer Engineering Wayne State University Detroit, MI 48202 ai4874@wayne.edu Loren
More informationSummary of Energy-Efficient Communication Protocol for Wireless Microsensor Networks
Summary of Energy-Efficient Communication Protocol for Wireless Microsensor Networks Juhana Yrjölä, Tik 58673B, jayrjola@cc.hut.fi 13th March 2005 Abstract Conventional routing protocols may not be optimal
More informationA Centroid Hierarchical Clustering Algorithm for Data Gathering in Wireless Sensor Networks.
A Centroid Hierarchical Clustering Algorithm for Data Gathering in Wireless Sensor Networks. Abdullah I. Alhasanat 1, Khetam Alotoon 2, Khaled D. Matrouk 3, and Mahmood Al-Khassaweneh 4 1,3 Department
More informationK-SEP: A more stable SEP using K-Means Clustering and Probabilistic Transmission in WSN
Research Article International Journal of Current Engineering and Technology E-ISSN 2277 4106, P-ISSN 2347-5161 2014 INPRESSCO, All Rights Reserved Available at http://inpressco.com/category/ijcet K-SEP:
More informatione3d: An Energy-Efficient Routing Algorithm for Wireless Sensor Networks
e3d: An Energy-Efficient Routing Algorithm for Wireless Sensor Networks - Ioan Raicu, Loren Schwiebert, Scott Fowler, Sandeep K.S. Gupta Department of Computer Science, University of Chicago, iraicu@cs.uchicago.edu
More informationA Weighted-Density Connected Dominating Set Data Gathering Algorithm for Wireless Sensor Networks
A Weighted-Density Connected Dominating Set Data Gathering Algorithm for Wireless Sensor Networks Larry King Clemson University, Clemson, SC 29634, USA E-mail: larryfking3@gmail.com Natarajan Meghanathan
More informationHCTE: Hierarchical Clustering based routing algorithm with applying the Two cluster heads in each cluster for Energy balancing in WSN
www.ijcsi.org 57 HCT: Hierarchical Clustering based routing algorithm with applying the Two cluster heads in each cluster for nergy balancing in WSN Nasrin Azizi 1, Jaber Karimpour, Farid Seifi 3 1 Technical
More informationDistributed clustering algorithms for data-gathering in wireless mobile sensor networks
J. Parallel Distrib. Comput. 67 (2007) 1187 1200 www.elsevier.com/locate/jpdc Distributed clustering algorithms for data-gathering in wireless mobile sensor networks Chuan-Ming Liu a,, Chuan-Hsiu Lee a,
More informationA Non_Ack Routing Protocol in Ad-hoc Wireless Sensor Networks
A Non_Ack Routing Protocol in Ad-hoc Wireless Sensor Networks 1, 1,3 1 1 Department of Electrical Engineering National Changhua University of Education Bao-Shan Campus: No., Shi-Da Road, Changhua City
More informationAn Adaptive Self-Organization Protocol for Wireless Sensor Networks
An Adaptive Self-Organization Protocol for Wireless Sensor Networks Kil-Woong Jang 1 and Byung-Soon Kim 2 1 Dept. of Mathematical and Information Science, Korea Maritime University 1 YeongDo-Gu Dongsam-Dong,
More informationDE-LEACH: Distance and Energy Aware LEACH
DE-LEACH: Distance and Energy Aware LEACH Surender Kumar University of Petroleum and Energy Studies, India M.Prateek, N.J.Ahuja University of Petroleum and Energy Studies, India Bharat Bhushan Guru Nanak
More informationAn Energy Efficiency Routing Algorithm of Wireless Sensor Network Based on Round Model. Zhang Ying-Hui
Joint International Mechanical, Electronic and Information Technology Conference (JIMET 2015) An Energy Efficiency Routing Algorithm of Wireless Sensor Network Based on Round Model Zhang Ying-Hui Software
More informationSCH-BASED LEACH ALGORITHM TO ENHANCE THE NETWORK LIFE TIME IN WIRELESS SENSOR NETWORK (WSN)
SCH-BASED LEACH ALGORITHM TO ENHANCE THE NETWORK LIFE TIME IN WIRELESS SENSOR NETWORK (WSN) Md. Nadeem Enam 1, Arun Kumar Bag 2 1 M.tech Student, 2 Assistant.Prof, Department of ECE, Bengal Institute of
More informationEnergy Efficient Hierarchical Cluster-Based Routing for Wireless Sensor Networks
IJCSNS International Journal of Computer Science and Network Security, VOL.16 No.4, April 2016 115 Energy Efficient Hierarchical Cluster-Based Routing for Wireless Sensor Networks Shideh Sadat Shirazi,
More informationChain-Based Protocols for Data Broadcasting and Gathering in the Sensor Networks Λ
Chain-Based Protocols for Data Broadcasting and Gathering in the Sensor Networks Λ Kemei Du, Jie Wu and Dan Zhou Department of Computer Science and Engineering Florida Atlantic University Boca Raton, FL
More informationAn Improved Chain-based Hierarchical Routing Protocol for Wireless Sensor Networks
An Improved Chain-based Hierarchical Routing Protocol for Wireless Sensor Networks Samah Alnajdi, Fuad Bajaber Department of Information Technology Faculty of Computing and Information Technology King
More informationKeywords Clustering, Sensor Nodes, Residual Energy, Wireless Sensor Networks, Zones
Zone-Based Clustering Protocol for Heterogeneous Wireless Sensor Networks S Taruna*, Sakshi Shringi** *(Department of Computer Science, Banasthali University, India) ** (Department of Information Technology,
More informationThe Impact of Clustering on the Average Path Length in Wireless Sensor Networks
The Impact of Clustering on the Average Path Length in Wireless Sensor Networks Azrina Abd Aziz Y. Ahmet Şekercioğlu Department of Electrical and Computer Systems Engineering, Monash University, Australia
More informationZonal based Deterministic Energy Efficient Clustering Protocol for WSNs
Zonal based Deterministic Energy Efficient Clustering Protocol for WSNs Prabhleen Kaur Punjab Institute of Technology, Kapurthala (PTU Main Campus), Punjab India ABSTRACT Wireless Sensor Network has gained
More informationMulti-Hop Clustering Protocol using Gateway Nodes in Wireless Sensor Network
Multi-Hop Clustering Protocol using Gateway Nodes in Wireless Sensor Network S. Taruna 1, Rekha Kumawat 2, G.N.Purohit 3 1 Banasthali University, Jaipur, Rajasthan staruna71@yahoo.com 2 Banasthali University,
More informationNew Data Clustering Algorithm (NDCA)
Vol. 7, No. 5, 216 New Data Clustering Algorithm () Abdullah Abdulkarem Mohammed Al-Matari Information Technology Department, Faculty of Computers and Information, Cairo University, Cairo, Egypt Prof.
More informationMinimum Spanning Tree based Improved Routing Protocol for Heterogeneous Wireless Sensor Network
Minimum Spanning Tree based Improved Routing Protocol for Heterogeneous Wireless Sensor Network Risha Vashist Research scholar Chandigarh Engineering College, Landran Suniti Dutt Assistant Professor Chandigarh
More informationHigh Speed Data Collection in Wireless Sensor Network
High Speed Data Collection in Wireless Sensor Network Kamal Kr. Gola a, *, Bhumika Gupta b, Zubair Iqbal c a Department of Computer Science & Engineering, Uttarakhand Technical University, Uttarakhand,
More informationFault tolerant Multi Cluster head Data Aggregation Protocol in WSN (FMCDA)
Fault tolerant Multi Cluster head Data Aggregation Protocol in WSN (FMCDA) Sushruta Mishra 1, Lambodar Jena 2, Alok Chakrabarty 3, Jyotirmayee Choudhury 4 Department of Computer Science & Engineering 1,
More informationHierarchical Coordination for Data Gathering (HCDG) in Wireless Sensor Networks
Hierarchical Coordination for Data Gathering (HCDG) in Wireless Sensor Networks Manal AL-Bzoor Department of Computer Science & Engineering University of Connecticut Storrs, CT, 0669 USA Laiali Almazaydeh
More informationA Proposed Technique for Reliable and Energy Efficient Hierarchical Routing in Heterogeneous Wireless Sensor Networks
A Proposed Technique for Reliable and nergy fficient Hierarchical Routing in Heterogeneous Wireless Sensor Networks Bharti 1, Mamta Sachdeva 2 1 M.Tech(CS), 2 Associate Professor 1 Computer Science and
More informationAnalysis of Cluster based Routing Algorithms in Wireless Sensor Networks using NS2 simulator
Analysis of Cluster based Routing Algorithms in Wireless Sensor Networks using NS2 simulator Ashika R. Naik Department of Electronics & Tele-communication, Goa College of Engineering (India) ABSTRACT Wireless
More informationWebpage: Volume 3, Issue III, March 2015 ISSN
A Survey on Hierarchical Routing Protocols for Wireless Sensor Networks Suparti Koul 1, Kiran Narang 2 1 M.Tech student Department of Computer Science and Engineering Hindu college of Engineering, Sonipat,
More informationEnergy Efficient Homogeneous and Heterogeneous System for Wireless Sensor Networks
International Journal of Computer Applications (975 8887) Energy Efficient Homogeneous and Heterogeneous System for Wireless Sensor Networks R.Saravanakumar Professor / ECE PABCET.Trichy. Tamilnadu.India
More informationAn Energy-Efficient Hierarchical Routing for Wireless Sensor Networks
Volume 2 Issue 9, 213, ISSN-2319-756 (Online) An Energy-Efficient Hierarchical Routing for Wireless Sensor Networks Nishi Sharma Rajasthan Technical University Kota, India Abstract: The popularity of Wireless
More informationZ-SEP: Zonal-Stable Election Protocol for Wireless Sensor Networks
Z-SEP: Zonal-Stable Election Protocol for Wireless Sensor Networks S. Faisal 1, N. Javaid 1, A. Javaid 2, M. A. Khan 1, S. H. Bouk 1, Z. A. Khan 3 1 COMSATS Institute of Information Technology, Islamabad,
More informationFUZZY LOGIC APPROACH TO IMPROVING STABLE ELECTION PROTOCOL FOR CLUSTERED HETEROGENEOUS WIRELESS SENSOR NETWORKS
3 st July 23. Vol. 53 No.3 25-23 JATIT & LLS. All rights reserved. ISSN: 992-8645 www.jatit.org E-ISSN: 87-395 FUZZY LOGIC APPROACH TO IMPROVING STABLE ELECTION PROTOCOL FOR CLUSTERED HETEROGENEOUS WIRELESS
More informationPSO-based Energy-balanced Double Cluster-heads Clustering Routing for wireless sensor networks
Available online at www.sciencedirect.com Procedia ngineering 15 (2011) 3073 3077 Advanced in Control ngineering and Information Science PSO-based nergy-balanced Double Cluster-heads Clustering Routing
More informationEnergy Aware Routing Protocol in Wireless Sensor Networks
IJCSNS International Journal of Computer Science and Network Security, VOL.6 No., January 6 nergy Aware Routing Protocol in Wireless Sensor Networks Backhyun Kim, and Iksoo Kim, Summary Mobile node should
More informationA Cluster-Based Energy Balancing Scheme in Heterogeneous Wireless Sensor Networks
A Cluster-Based Energy Balancing Scheme in Heterogeneous Wireless Sensor Networks Jing Ai, Damla Turgut, and Ladislau Bölöni Networking and Mobile Computing Research Laboratory (NetMoC) Department of Electrical
More informationAnalysis of Energy Efficient Routing Protocols in Wireless Sensor Networks
International Journal of Computer Science & Communication Vol. 1, No. 1, January-June 010, pp. 113-118 Analysis of Energy Efficient Routing Protocols in Wireless Sensor Networks Sanjeev Saini 1, Ram Sewak
More informationEnergy- efficient Routing Protocol for Homogeneous Wireless Sensor Networks
Energy- efficient Routing Protocol for Homogeneous Wireless Sensor Networks Gaurav Bathla #1 and Gulista Khan #2 # Department of Computer Science & Engineering, HEC, Jagadhri, India 1 gauravbathla86@gmail.com
More informationHierarchical Routing Algorithm to Improve the Performance of Wireless Sensor Network
Hierarchical Routing Algorithm to Improve the Performance of Wireless Sensor Network Deepthi G B 1 Mrs. Netravati U M 2 P G Scholar (Digital Electronics), Assistant Professor Department of ECE Department
More informationFig. 2: Architecture of sensor node
Volume 4, Issue 11, November 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com To Reduce
More informationA Configurable Time-Controlled Clustering Algorithm for Wireless Sensor Networks
A Configurable Time-Controlled Clustering Algorithm for Wireless Sensor Networks S. SELVAKENNEDY # AND S. SINNAPPAN * # School of IT, Madsen Bldg. F09, University of Sydney, NSW 006, Australia. skennedy@it.usyd.edu.au
More informationLow Energy Adaptive Clustering Hierarchy based routing Protocols Comparison for Wireless Sensor Networks
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661,p-ISSN: 2278-8727, Volume 16, Issue 6, Ver. II (Nov Dec. 2014), PP 56-61 Low Energy Adaptive Clustering Hierarchy based routing Protocols
More informationPower Aware Chain Routing Protocol for Data Gathering in Sensor Networks
Power Aware Chain Routing Protocol for Data Gathering in Sensor Networks #Minh-Long Pham, Daeyoung Kim, Yoonmee Doh, Seong-eun Yoo Information and Communications University, Korea {longpm, kimd, seyoo@icu.ac.kr
More informationEnergy-efficient routing algorithms for Wireless Sensor Networks
Energy-efficient routing algorithms for Wireless Sensor Networks Chao Peng Graduate School of Information Science Japan Advanced Institute of Science and Technology March 8, 2007 Presentation Flow Introduction
More informationEnergy Balancing LEACH for Wireless Sensor Networks
Energy Balancing LEACH for Wireless Sensor Networks Department of Computer Science, Sookmyung Women s University, Korea choejn@sookmyung.ac.kr, axxujun@hotmail.com Abstract This paper suggests an algorithm
More informationA Clustering Routing Protocol for Energy Balance of Wireless Sensor Network based on Simulated Annealing and Genetic Algorithm
, pp.71-82 http://dx.doi.org/10.14257/ijhit.2014.7.2.08 A Clustering Routing Protocol for Energy Balance of Wireless Sensor Network based on Simulated Annealing and Genetic Algorithm Haitao Zhang, Shiwei
More informationAn Enhanced General Self-Organized Tree-Based Energy- Balance Routing Protocol (EGSTEB) for Wireless Sensor Network
www.ijecs.in International Journal Of Engineering And Computer Science ISSN: 239-7242 Volume 4 Issue 8 Aug 205, Page No. 3640-3643 An Enhanced General Self-Organized Tree-Based Energy- Balance Routing
More informationGeneric Energy-Efficient Geographic Routing for Ad-Hoc Wireless Networks
Generic Energy-Efficient Geographic Routing for Ad-Hoc Wireless Networks Chao-Lieh Chen 1, Jeng-Wei Lee 2, Cheng-Zh Lin 3, Yi-Tsung Chen 2, Jar-Shone Ker 3, and Yau-Hwang Kuo 2 1 Department of Electronic
More informationA Modified LEACH Protocol for Increasing Lifetime of the Wireless Sensor Network
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 16, No 3 Sofia 2016 Print ISSN: 1311-9702; Online ISSN: 1314-4081 DOI: 10.1515/cait-2016-0040 A Modified LEACH Protocol for
More information(EBHCR) Energy Balancing and Hierarchical Clustering Based Routing algorithm for Wireless Sensor Networks
Australian Journal of Basic and Applied Sciences, 5(9): 1376-1380, 2011 ISSN 1991-8178 (EBHCR) Energy Balancing and Hierarchical Clustering Based Routing algorithm for Wireless Sensor Networks 1 Roghaiyeh
More informationSECURE AND ROBUST ENERGY-EFFICIENT AND RELIABLE ROUTING FOR MULTI HOP NETWORKS USING WIRELESS SENSOR NETWORKS
SECURE AND ROBUST ENERGY-EFFICIENT AND RELIABLE ROUTING FOR MULTI HOP NETWORKS USING WIRELESS SENSOR NETWORKS Sridevi H K 1, Praveen K B 2 1M.Tech student, Department of Telecommunication Engineering,
More informationProbabilistic Modeling of Leach Protocol and Computing Sensor Energy Consumption Rate in Sensor Networks
Probabilistic Modeling of Leach Protocol and Computing Sensor Energy Consumption Rate in Sensor Networks Dezhen Song CS Department, Texas A&M University Technical Report: TR 2005-2-2 Email: dzsong@cs.tamu.edu
More informationLow Energy Adaptive Clustering Hierarchy with Deterministic Cluster-Head Selection
Fourth IEEE Conference on Mobile and Wireless Communications Networks, Stockholm, erschienen in Proceedings, S. 368-372, ISBN 0-7803-7606-4 World Scientific Publishing Co. Pte. Ltd., September 2002 Low
More informationAN ALGORITHM TO DETERMINE ENERGY-AWARE MAXIMAL LEAF NODES DATA GATHERING TREE FOR WIRELESS SENSOR NETWORKS
AN ALGORITHM TO DETERMINE ENERGY-AWARE MAXIMAL LEAF NODES DATA GATHERING TREE FOR WIRELESS SENSOR NETWORKS NATARAJAN MEGHANATHAN Assistant Professor, Department of Computer Science, Jackson State University,
More informationMinimum Overlapping Layers and Its Variant for Prolonging Network Lifetime in PMRC-based Wireless Sensor Networks
Minimum Overlapping Layers and Its Variant for Prolonging Network Lifetime in PMRC-based Wireless Sensor Networks Qiaoqin Li 12, Mei Yang 1, Hongyan Wang 1, Yingtao Jiang 1, Jiazhi Zeng 2 1 Department
More informationUse of Tree Traversal Algorithms for Chain Formation in the PEGASIS Data Gathering Protocol for Wireless Sensor Networks
KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS VOL. 3, NO. 6, December 2009 612 Copyright c 2009 KSII Use of Tree Traversal Algorithms for Chain Formation in the PEGASIS Data Gathering Protocol
More informationEnergy-Efficient Communication Protocol for Wireless Microsensor Networks
Copyright 2 IEEE. Published in the Proceedings of the Hawaii International Conference on System Sciences, January 4-7, 2, Maui, Hawaii. Energy-Efficient Communication Protocol for Wireless Microsensor
More informationEffect of Sensor Mobility and Channel Fading on Wireless Sensor Network Clustering Algorithms
Effect of Sensor Mobility and Channel Fading on Wireless Sensor Network Clustering Algorithms Ahmed H. Gabr Department of Computer Engineering Arab Academy for Science & technology Cairo, Egypt E-mail:
More informationPERFORMANCE EVALUATION OF TOPOLOGY CONTROL ALGORITHMS FOR WIRELESS SENSOR NETWORKS
PERFORMANCE EVALUATION OF TOPOLOGY CONTROL ALGORITHMS FOR WIRELESS SENSOR NETWORKS Zahariah Manap 1, M. I. A Roslan 1, W. H. M Saad 1, M. K. M. Nor 1, Norharyati Harum 2 and A. R. Syafeeza 1 1 Faculty
More informationEnergy-Efficient Communication Protocol for Wireless Micro-sensor Networks
Energy-Efficient Communication Protocol for Wireless Micro-sensor Networks Paper by: Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan Outline Brief Introduction on Wireless Sensor
More informationA REVIEW ON LEACH-BASED HIERARCHICAL ROUTING PROTOCOLS IN WIRELESS SENSOR NETWORK
A REVIEW ON LEACH-BASED HIERARCHICAL ROUTING PROTOCOLS IN WIRELESS SENSOR NETWORK Md. Nadeem Enam 1, Ozair Ahmad 2 1 Department of ECE, Maulana Azad College of Engineering & Technology, Patna, (India)
More informationHomogeneous vs Heterogeneous Clustered Sensor Networks: A Comparative Study
1 Homogeneous vs Heterogeneous Clustered Sensor Networks: A Comparative Study Vivek Mhatre, Catherine Rosenberg School of Electrical and Computer Eng., Purdue University, West Lafayette, IN 47907-1285
More informationAN ENERGY EFFICIENT AND RELIABLE TWO TIER ROUTING PROTOCOL FOR TOPOLOGY CONTROL IN WIRELESS SENSOR NETWORKS
AN ENERGY EFFICIENT AND RELIABLE TWO TIER ROUTING PROTOCOL FOR TOPOLOGY CONTROL IN WIRELESS SENSOR NETWORKS Shivakumar A B 1, Rashmi K R 2, Ananda Babu J. 3 1,2 M.Tech (CSE) Scholar, 3 CSE, Assistant Professor,
More informationWSN Routing Protocols
WSN Routing Protocols 1 Routing Challenges and Design Issues in WSNs 2 Overview The design of routing protocols in WSNs is influenced by many challenging factors. These factors must be overcome before
More informationReview on Packet Forwarding using AOMDV and LEACH Algorithm for Wireless Networks
RESEARCH ARTICLE OPEN ACCESS Review on Packet Forwarding using AOMDV and LEACH Algorithm for Wireless Networks Mrs. P. V. Meghare 1, Prof. P. A. Deshmukh 2 1 Department of Computer Science, Nagpur University,
More informationA PROPOSAL FOR IMPROVE THE LIFE- TIME OF WIRELESS SENSOR NETWORK
A PROPOSAL FOR IMPROVE THE LIFE- TIME OF WIRELESS SENSOR NETWORK ABSTRACT Tran Cong Hung1 and Nguyen Hong Quan2 1Post & Telecommunications Institute of Technology, Vietnam 2University of Science, Ho Chi
More informationMobile Sink to Track Multiple Targets in Wireless Visual Sensor Networks
Mobile Sink to Track Multiple Targets in Wireless Visual Sensor Networks William Shaw 1, Yifeng He 1, and Ivan Lee 1,2 1 Department of Electrical and Computer Engineering, Ryerson University, Toronto,
More informationESRP: Energy Sensitive Routing Protocol for Wireless Sensor Networks
Research Article International Journal of Current Engineering and Technology E-ISSN 2277 4106, P-ISSN 2347-5161 2014 INPRESSCO, All Rights Reserved Available at http://inpressco.com/category/ijcet Moumita
More informationDesign Issues in Constructing Chain Oriented Logical Topology for Wireless Sensor Networks and a Solution
J. Sens. Actuator Netw. 2013, 2, 354-387; doi:10.3390/jsan2020354 Article OPEN ACCESS Journal of Sensor and Actuator Networks ISSN 2224-2708 www.mdpi.com/journal/jsan Design Issues in Constructing Chain
More informationPERFORMANCE EVALUATION OF DIFFERENT LOGICAL TOPOLOGIES AND THEIR RESPECTIVE PROTOCOLS FOR WIRELESS SENSOR NETWORKS
PERFORMANCE EVALUATION OF DIFFERENT LOGICAL TOPOLOGIES AND THEIR RESPECTIVE PROTOCOLS FOR WIRELESS SENSOR NETWORKS N. A. M. Alduais 1, L.Audah 2, A. Jamil 2 and J. Abdullah 2 1 Department of Computer Engineering,
More informationPOWER-AWARE METRICS FOR WIRELESS SENSOR NETWORKS
International Journal of Computers and Applications, Vol. 26, No. 4, 2004 POWER-AWARE METRICS FOR WIRELESS SENSOR NETWORKS A. Salhieh and L. Schwiebert Abstract Energy conservation is a critical issue
More informationDalimir Orfanus (IFI UiO + ABB CRC), , Cyber Physical Systems Clustering in Wireless Sensor Networks 2 nd part : Examples
Dalimir Orfanus (IFI UiO + ABB CRC), 27.10.2011, Cyber Physical Systems Clustering in Wireless Sensor Networks 2 nd part : Examples Clustering in Wireless Sensor Networks Agenda LEACH Energy efficient
More informationEnergy Efficient Zonal Stable Election Protocol for WSNs
Energy Efficient Zonal Stable Election Protocol for WSNs G.Chandini, (M.Tech), Department of Electronics and Communication Engineering., Sri Sivani College Of Engineering, Srikakulam, A.P, India Rajavali
More informationDYNAMIC RE-CLUSTERING LEACH-BASED (DR-LEACH) PROTOCOL FOR WIRELESS SENSOR NETWORKS
DYNAMIC RE-CLUSTERING -BASED () PROTOCOL FOR WIRELESS SENSOR NETWORKS Abdallah Ijjeh 1,Abdalraheem Ijjeh 2,Huthaifa Al-Issa 1,Saed Thuneibat 1 1 Department of Electrical and Electronic Engineering, Al-Balqa`
More informationMAP: The New Clustering Algorithm based on Multitier Network Topology to Prolong the Lifetime of Wireless Sensor Network
MAP: The New Clustering Algorithm based on Multitier Network Topology to Prolong the Lifetime of Wireless Sensor Network Wan Isni Sofiah Wan Din 1 Saadiah Yahya 2 Faculty of Computer and Mathematical Sciences
More informationEnergy Efficient System for Wireless Sensor Networks using Modified RECHS Protocol
Energy Efficient System for Wireless Sensor Networks using Modified RECHS Protocol Mr. Nikhil Vilasrao Deshmukh Department of Electronics Engineering K.I.T. s College of Engineering Kolhapur, India n.deshmukh83@gmail.com
More informationINTERNATIONAL JOURNAL OF ADVANCED RESEARCH IN ENGINEERING AND TECHNOLOGY (IJARET)
INTERNATIONAL JOURNAL OF ADVANCED RESEARCH IN ENGINEERING AND TECHNOLOGY (IJARET) ISSN 0976-6480 (Print) ISSN 0976-6499 (Online) Volume 4, Issue 1, January- February (2013), pp. 50-58 IAEME: www.iaeme.com/ijaret.asp
More informationENERGY EFFICIENT TWO STAGE CHAIN ROUTING PROTOCOL (TSCP) FOR WIRELESS SENSOR NETWORKS
ENERGY EFFICIENT TWO STAGE CHAIN ROUTING PROTOCOL (TSCP) FOR WIRELESS SENSOR NETWORKS *1 HUSAM KAREEM, 2 S.J. HASHIM, 3 SHAMALA SUBERAMANIAM, 4 ADUWATI SALI 1, 2, 4 Faculty of Engineering, Universiti Putra
More information