Edge-Based Beaconing Schedule in Duty- Cycled Multihop Wireless Networks
|
|
- Darrell Preston
- 5 years ago
- Views:
Transcription
1 Edge-Based Beaconing Schedule in Duty- Cycled Multihop Wireless Networks Quan Chen, Hong Gao, Yingshu Li, Siyao Cheng, and Jianzhong Li Harbin Institute of Technology, China Quan Harbin Institute of Technology
2 Contents Motivation The Need For Beaconing Schedule Beaconing Schedule in Duty-Cycled WSNs Previous Work Problem Definition The Edge-based Scheduling Framework Beaconing Schedule under Protocol Interference Model Beaconing Schedule under Protocol Interference Model Evaluation Conclusions
3 The Need For Beaconing Schedule Beaconing is an essential operation for many networking protocols in which each node broadcasts a packet to all of its one-hop neighbors, e.g. Discovering network topology Data collection Data dissemination Routing, Multicasting, Broadcasting Multipath routing Network coding
4 Beaconing Schedule in Duty-Cycled WSNs Duty-Cycled WSNs Each node works cyclically with two states: active and dormant Each node can only receive packet in active state a b c A working period (WP) WP1 e 0 ab 1 WP2 0 1 Active State 2 2 Dormant State 3 3
5 Beaconing Schedule in Duty-Cycled WSNs Duty-Cycled WSNs Each node works cyclically with two states: active and dormant Each node can only receive packet in active state a b c e ab WP 0 Beaconing Schedule e ba e bc e cb Active State Dormant State
6 Beaconing Schedule in Duty-Cycled WSNs Duty-Cycled WSNs Each node works cyclically with two states: active and dormant Each node can only receive packet in active state a b c Beaconing Schedule e ab e ba e bc e cb WP1 WP Active State Dormant State
7 Beaconing Schedule in Duty-Cycled WSNs Duty-Cycled WSNs Each node works cyclically with two states: active and dormant Each node can only receive packet in active state a b c Beaconing Schedule e ab e ba e bc e cb WP1 WP Active State Dormant State
8 Related Work Existed solution L. Wang, P. J. Wan and K. Young, "Minimum-Latency Beaconing Schedule in duty-cycled multihop wireless networks," in Proc. of IEEE INFOCOM, This method assumes each node has only one active time slot per working cycle, and exploits a node-based schedule! a b c e.g., at time slot 1 Conflict graph a conflicting c Coloring a with 0 Coloring c with 1 This node-based schedule cannot assign its active time slot among neighbors intelligently!
9 Problem Definition Network Model Let T denote a working period Let W(u) denote nodes working plan, i.e. the active time slot in a working period An example of duty-cycled WSNs, Where T =4
10 Problem Definition INPUT A duty-cycled sensor network G=(V, E); The working plans for all nodes, {W(u) v V}. OUTPUT The edge based schedule S={(e uv, t uv ) e uv E },which satisfies: 1) For (e uv, t uv ) S, t uv =C T +t 0,C 0, t 0 W(v); 2) S is conflict free; 3) BL(S)=min{ t uv } is minimized. The MLBSDCA problem is NP-hard under protocol interference model.
11 Edge-based Scheduling Framework Constructing super conflict graph (SCG) G i (0 i T -1): the induced subgraph of G at time slot i, is formed by the nodes that are active at time slot i and their neighbors. H i : the conflict graph of G i For example, the induced subgraph G 0 and H 0 G G 0 H 0
12 Edge-based Scheduling Framework Constructing super conflict graph (SCG) Super conflict graph H S = {H i 0 i T 1} G H s Beaconing Schedule Label Coloring Problem!
13 Edge-based Scheduling Framework Label Coloring Problem Coloring all the labels in H S, not all the vertexes in H S Coloring and deleting technique
14 Edge-based Scheduling Framework Label Coloring Problem Coloring all the labels in H S, not all the vertexes in H S Coloring and deleting technique
15 Beaconing under Protocol Interference Model Scheduling by time slot Main idea:exploit the coloring method to color H 0 ~H T -1 simultaneously First-Fit coloring: each vertex is colored and assigned the first color it fits WP 1 WP 2 Depends on a fixed order! Massive Data Computing Research
16 Beaconing under Protocol Interference Model Scheduling by time slot Main idea:exploit the coloring method to color H 0 ~H T -1 simultaneously First-Fit coloring: each vertex is colored and assigned the first color it fits WP 0 WP 1 WP 2 WP 3 Depends on a fixed order! Massive Data Computing Research
17 Beaconing under Protocol Interference Model Scheduling by working period Main idea: Schedule as much vertexes as possible in a working period Each vertex has 3 states: White, Yellow and Black White: vertexes can be scheduled at current WP C Black: Vertexes can not be scheduled at current WP C Yellow: Vertexes scheduled at current WP C
18 Beaconing under Protocol Interference Model Scheduling by working period 1) Isolated vertexes iterative scheduling and removing 2) Dynamic largest degree first scheduling Vertexes Scheduling at WP 0
19 Beaconing under Protocol Interference Model Scheduling by working period 1) Isolated vertexes iterative scheduling and removing 2) Dynamic largest degree first scheduling Vertexes Scheduling at WP 0
20 Beaconing under Protocol Interference Model Scheduling by working period 1) Isolated vertexes iterative scheduling and removing 2) Dynamic largest degree first scheduling
21 Beaconing under Protocol Interference Model Performance analysis Theorem 4. The lower bound on the latency of any optimal beaconing schedule for MLBSDCA under the protocol interference model is at least l ( W G)+1m T, where (G) denotes the maximum degree in G, and W denotes the maximum number of active time slots in a working cycle. Theorem 5. The approximation ratio of the DLFBS algorithm is at most (ρ + 1) 2 W. When W =ρ = 1, the approximation ratio is only 4, which is better than 10 in [Wang, INFOCOM 2015]!
22 Beaconing under Protocol Interference Model Performance analysis Discussion of [Wang, INFOCOM 2015] s Lower Bound Analysis The reason is that they construct the conflicted graph based on nodes, not on edges, which may result in inaccuracy.
23 Beaconing under Physical Interference Model Physical Interference Model Node v can receive the messages from node u successfully if only if where α is the path-loss exponent which usually belongs to [2, 4], η is a positive reference loss parameter of power, ξ is the background noise, and node w denotes any other transmitting nodes at the same time slot.
24 Beaconing under Physical Interference Model Physical Interference Model Lemma 3. [18] Assume E = { e uv } is a set of transmissions. If for any e uv and e mn in E (u m), d(u, m) > ρ,then all transmissions in E can transmit successfully under the physical interference model. Construct the SCG according Lemma 3, and then use the coloring and deleting method in GFFC and DLFBS.
25 Beaconing under Physical Interference Model Improvement for DLFBS algorithm If two vertexes are connected in Hs, it does not means it is really conflicted. Each vertex has 3 states: White, Yellow and Black When a vertex is scheduled, its neighbors do not need to be marked Black. A vertex marked Black if once it is scheduled at current WP it causes collisions.
26 Beaconing under Physical Interference Model Performance analysis Theorem 6. The lower bound on the latency of any optimal beaconing schedule for MLBSDCA under the physical interference model is at least l ( W G)+1m T, where (G) denotes the maximum degree in G, and W denotes the maximum number of active time slots in a working cycle. Theorem 7. The approximation ratio of the DLFBS-ph and DLF algorithm is at most ( ρ)2 W.
27 Evaluation Baseline algorithm Beaconing under protocol interference model FFBSD [Wang,INFOCOM 2015] SCBSD [Wang,INFOCOM 2015] Beaconing under physical interference model FFBSD-ph [Wang,INFOCOM 2015] Network Topology Random generated in a 200m 200m field Networkx generated Graph
28 Beaconing Latency Protocol Interference Model 20% 200% Random Deployed Network
29 Beaconing Latency Protocol Interference Model 1.6 times 1.5 times Networkx Generated Graph
30 Beaconing Latency Physical Interference Model 7.7 times 7.5 times Random Deployed Network
31 Throughput Protocol Interference Model 2.4 times Random Deployed Network
32 Throughput Protocol Interference Model 1.7 times Networkx Generated Graph
33 Conclusions This paper proposes an edge-based scheduling framework for beaconing in duty-cycled WSNs. A novel kind of coloring problem, named label coloring problem, is proposed. Under the protocol interference model, a (ρ + 1) 2 * W approximation algorithm is designed. Under the physical interference model, a ( ρ) 2 * W approximation algorithm is designed Evaluation reveals our design can greatly reduce the beaconing latency.
Edge-Based Beaconing Schedule in Duty-Cycled Multihop Wireless Networks
Edge-Based Beaconing Schedule in Duty-Cycled Multihop Wireless Networks Quan Chen, Hong Gao, Yingshu Li, Siyao Cheng, Jianzhong Li Harbin Institute of Technology, Georgia State University {chenquan,honggao,csy,lijzh}@hit.edu.cn,
More informationDistributed Data Aggregation Scheduling in Wireless Sensor Networks
Distributed Data Aggregation Scheduling in Wireless Sensor Networks Bo Yu, Jianzhong Li, School of Computer Science and Technology, Harbin Institute of Technology, China Email: bo yu@hit.edu.cn, lijzh@hit.edu.cn
More informationOutline. Introduction. Outline. Introduction (Cont.) Introduction (Cont.)
An Energy-Efficient Distributed Algorithm for Minimum-Latency Aggregation Scheduling in Wireless Sensor Networks Yingshu Li, Longjiang Guo, and Sushil K. Prasad Department of Computer Science, Georgia
More informationConstructing Connected Dominating Sets with Bounded Diameters in Wireless Networks
Constructing Connected Dominating Sets with Bounded Diameters in Wireless Networks Yingshu Li Department of Computer Science Georgia State University Atlanta, GA 30303 yli@cs.gsu.edu Donghyun Kim Feng
More informationGenetic-Algorithm-Based Construction of Load-Balanced CDSs in Wireless Sensor Networks
Genetic-Algorithm-Based Construction of Load-Balanced CDSs in Wireless Sensor Networks Jing He, Shouling Ji, Mingyuan Yan, Yi Pan, and Yingshu Li Department of Computer Science Georgia State University,
More informationOn minimum m-connected k-dominating set problem in unit disc graphs
J Comb Optim (2008) 16: 99 106 DOI 10.1007/s10878-007-9124-y On minimum m-connected k-dominating set problem in unit disc graphs Weiping Shang Frances Yao Pengjun Wan Xiaodong Hu Published online: 5 December
More informationStrongly Connected Dominating Sets in Wireless Sensor Networks with Unidirectional Links
Strongly Connected Dominating Sets in Wireless Sensor Networks with Unidirectional Links Ding-Zhu Du 1,MyT.Thai 1,YingshuLi 2,DanLiu 1, and Shiwei Zhu 1 1 Department of Computer Science and Engineering,
More informationAlgorithms for minimum m-connected k-tuple dominating set problem
Theoretical Computer Science 381 (2007) 241 247 www.elsevier.com/locate/tcs Algorithms for minimum m-connected k-tuple dominating set problem Weiping Shang a,c,, Pengjun Wan b, Frances Yao c, Xiaodong
More informationTopology Control in Wireless Networks 4/24/06
Topology Control in Wireless Networks 4/4/06 1 Topology control Choose the transmission power of the nodes so as to satisfy some properties Connectivity Minimize power consumption, etc. Last class Percolation:
More informationConnected Dominating Sets in Wireless Networks with Different Transmission Ranges
1 Connected Dominating Sets in Wireless Networks with Different Transmission Ranges My T. Thai Feng Wang Dan Liu Shiwei Zhu Ding-Zhu Du Dept. of Computer Science & Enginering University of Minnesota Minneapolis,
More informationAgreedy approximation for minimum connected dominating sets
Theoretical Computer Science 329 2004) 325 330 www.elsevier.com/locate/tcs Note Agreedy approximation for minimum connected dominating sets Lu Ruan a, Hongwei Du b, Xiaohua Jia b,,1, Weili Wu c,1,2, Yingshu
More informationAlgorithms for Minimum m-connected k-dominating Set Problem
Algorithms for Minimum m-connected k-dominating Set Problem Weiping Shang 1,2, Frances Yao 2,PengjunWan 3, and Xiaodong Hu 1 1 Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing, China
More informationMinimum connected dominating sets and maximal independent sets in unit disk graphs
Theoretical Computer Science 352 (2006) 1 7 www.elsevier.com/locate/tcs Minimum connected dominating sets and maximal independent sets in unit disk graphs Weili Wu a,,1, Hongwei Du b, Xiaohua Jia b, Yingshu
More informationAn Approximation Algorithm for Connected Dominating Set in Ad Hoc Networks
An Approximation Algorithm for Connected Dominating Set in Ad Hoc Networks Xiuzhen Cheng, Min Ding Department of Computer Science The George Washington University Washington, DC 20052, USA {cheng,minding}@gwu.edu
More informationSimulations of the quadrilateral-based localization
Simulations of the quadrilateral-based localization Cluster success rate v.s. node degree. Each plot represents a simulation run. 9/15/05 Jie Gao CSE590-fall05 1 Random deployment Poisson distribution
More informationEfficient Aggregation Scheduling in Multihop Wireless Sensor Networks with SINR Constraints
1 Efficient Aggregation Scheduling in Multihop Wireless Sensor Networks with SINR Constraints Xiaohua Xu, Xiang-Yang Li, Senior Member, IEEE, and Min Song, Senior Member, IEEE Abstract We study delay efficient
More informationSMITE: A Stochastic Compressive Data Collection. Sensor Networks
SMITE: A Stochastic Compressive Data Collection Protocol for Mobile Wireless Sensor Networks Longjiang Guo, Raheem Beyah, and Yingshu Li Department of Computer Science, Georgia State University, USA Data
More informationA Constant Factor Distributed Algorithm for Computing Connected Dominating Sets in Wireless Sensor Networks
A Constant Factor Distributed Algorithm for Computing Connected Dominating Sets in Wireless Sensor Networks Kamrul Islam, Selim G Akl, and Henk Meijer School of Computing, Queen s University Kingston,
More informationInterference-Aware Real-Time Flow Scheduling for Wireless Sensor Networks
Interference-Aware Real-Time Flow Scheduling for Wireless Sensor Networks Octav Chipara, Chengjie Wu, Chenyang Lu, William Griswold University of California, San Diego Washington University in St. Louis
More informationOpportunistic Transmission Based QoS Topology Control. QoS; Wireless Sensor Networks
Opportunistic Transmission Based QoS Topology Control in Wireless Sensor Networks Jian Ma, Chen Qian, Qian Zhang, and Lionel M. Ni Hong Kong University of Science and Technology {majian, cqian, qianzh,
More informationADB: An Efficient Multihop Broadcast Protocol Based on Asynchronous Duty-Cycling in Wireless Sensor Networks
AD: An Efficient Multihop roadcast Protocol ased on Asynchronous Duty-Cycling in Wireless Sensor Networks Yanjun Sun* Omer Gurewitz Shu Du Lei Tang* David. Johnson* *Rice University en Gurion University
More informationWSN NETWORK ARCHITECTURES AND PROTOCOL STACK
WSN NETWORK ARCHITECTURES AND PROTOCOL STACK Sensing is a technique used to gather information about a physical object or process, including the occurrence of events (i.e., changes in state such as a drop
More informationApproximating Node-Weighted Multicast Trees in Wireless Ad-Hoc Networks
Approximating Node-Weighted Multicast Trees in Wireless Ad-Hoc Networks Thomas Erlebach Department of Computer Science University of Leicester, UK te17@mcs.le.ac.uk Ambreen Shahnaz Department of Computer
More informationAlgorithm and Complexity of Disjointed Connected Dominating Set Problem on Trees
Algorithm and Complexity of Disjointed Connected Dominating Set Problem on Trees Wei Wang joint with Zishen Yang, Xianliang Liu School of Mathematics and Statistics, Xi an Jiaotong University Dec 20, 2016
More informationOn Benefits of Network Coding in Bidirected Networks and Hyper-networks
On Benefits of Network Coding in Bidirected Networks and Hyper-networks Zongpeng Li University of Calgary / INC, CUHK December 1 2011, at UNSW Joint work with: Xunrui Yin, Xin Wang, Jin Zhao, Xiangyang
More informationBounds on the Benefit of Network Coding for Multicast and Unicast Sessions in Wireless Networks
Bounds on the Benefit of Network Coding for Multicast and Unicast Sessions in Wireless Networks Alireza Keshavarz-Haddad Rudolf Riedi Department of Electrical and Computer Engineering and Department of
More informationConstructing weakly connected dominating set for secure clustering in distributed sensor network
J Comb Optim (01) 3:301 307 DOI 10.1007/s10878-010-9358-y Constructing weakly connected dominating set for secure clustering in distributed sensor network Hongjie Du Weili Wu Shan Shan Donghyun Kim Wonjun
More informationFault Tolerant Topology Control for One-to-All Communications in Symmetric Wireless Networks
Fault Tolerant Topology Control for One-to-All Communications in Symmetric Wireless Networks F. Wang* Department of Computer Science and Engineering, University of Minnesota, USA E-mail: fwang@cs.umn.edu
More informationAn Automatic Presence Service for Low Duty-Cycled Mobile Sensor Networks
Mobile Netw Appl (2011) 16:460 474 DOI 10.1007/s11036-011-0326-2 An Automatic Presence Service for Low Duty-Cycled Mobile Sensor Networks Shouwen Lai Binoy Ravindran Published online: 18 June 2011 Springer
More informationIN WIRELESS SENSOR NETWORKS
CONSTRUCTING K-CONNECTED M-DOMINATING SETS IN WIRELESS SENSOR NETWORKS Yiwei Wu, Feng Wang,MyT.Thai and Yingshu Li Department of Computer Science, Georgia State University, {wyw, yli}@cs.gsu.edu Department
More informationRelay Sensor Placement in Wireless Sensor Networks
Relay Sensor Placement in Wireless Sensor Networks Xiuzhen Cheng Ding-Zhu Du Lusheng Wang Baogang Xu Abstract This paper addresses the following relay sensor placement problem: given the set of duty sensors
More informationA Localized Algorithm for Reducing the Size of Dominating Set in Mobile Ad Hoc Networks
A Localized Algorithm for Reducing the Size of Dominating Set in Mobile Ad Hoc Networks Yamin Li and Shietung Peng Department of Computer Science Hosei University Tokyo 18-858 Japan {yamin, speng}@k.hosei.ac.jp
More informationBeyond Interference Avoidance: Distributed Sub-network Scheduling in Wireless Networks with Local Views
Beyond Interference Avoidance: Distributed Sub-network Scheduling in Wireless etworks with Local Views Pedro E. Santacruz, Vaneet Aggarwal, and Ashutosh Sabharwal Abstract In most wireless networks, nodes
More informationRandomized Algorithms for Approximating a Connected Dominating Set in Wireless Sensor Networks
Randomized Algorithms for Approximating a Connected Dominating Set in Wireless Sensor Networks Akshaye Dhawan, Michelle Tanco, Aaron Yeiser Department of Mathematics and Computer Science Ursinus College
More informationLow Power Hitch-hiking Broadcast in Ad Hoc Wireless Networks
Low Power Hitch-hiking Broadcast in Ad Hoc Wireless Networks Mihaela Cardei, Jie Wu, and Shuhui Yang Department of Computer Science and Engineering Florida Atlantic University Boca Raton, FL 33431 {mihaela,jie}@cse.fau.edu,
More informationMulti-Rate Interference Sensitive and Conflict Aware Multicast in Wireless Ad hoc Networks
Multi-Rate Interference Sensitive and Conflict Aware Multicast in Wireless Ad hoc Networks Asma Ben Hassouna, Hend Koubaa, Farouk Kamoun CRISTAL Laboratory National School of Computer Science ENSI La Manouba,
More informationExtended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication
Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication Jie Wu, Mihaela Cardei, Fei Dai, and Shuhui Yang Department of Computer Science and Engineering Florida Atlantic
More informationAn Efficient Bandwidth Estimation Schemes used in Wireless Mesh Networks
An Efficient Bandwidth Estimation Schemes used in Wireless Mesh Networks First Author A.Sandeep Kumar Narasaraopeta Engineering College, Andhra Pradesh, India. Second Author Dr S.N.Tirumala Rao (Ph.d)
More informationPRIORITY-BASED BROADCASTING OF SENSITIVE DATA IN ERROR-PRONE WIRELESS NETWORKS
PRIORITY-BASED BROADCASTING OF SENSITIVE DATA IN ERROR-PRONE WIRELESS NETWORKS Pouya Ostovari, Jie Wu, and Ying Dai Center for Networked Computing http://www.cnc.temple.edu Agenda 2 Introduction Motivation
More informationLiterature Review on Characteristic Analysis of Efficient and Reliable Broadcast in Vehicular Networks
International Journal of Electronics and Communication Engineering. ISSN 0974-2166 Volume 6, Number 3 (2013), pp. 205-210 International Research Publication House http://www.irphouse.com Literature Review
More informationOn approximate optimal dual power assignment for biconnectivity and edge-biconnectivity
Theoretical Computer Science 396 (2008) 180 190 www.elsevier.com/locate/tcs On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity Chen Wang a,, Myung-Ah Park b, James
More informationA Proposed Paper on Joint Priority Based Approach for Scheduling and Congestion Control in Multipath Multi-hop WSN
A Proposed Paper on Joint Priority Based Approach for Scheduling and Congestion Control in Multipath Multi-hop WSN Sweta A.Kahurke M.Tech(IV) Wireless communication & Computing G.H.Raisoni College Of Engineering
More informationAchieve Significant Throughput Gains in Wireless Networks with Large Delay-Bandwidth Product
Available online at www.sciencedirect.com ScienceDirect IERI Procedia 10 (2014 ) 153 159 2014 International Conference on Future Information Engineering Achieve Significant Throughput Gains in Wireless
More informationKeywords: Medium access control, network coding, routing, throughput, transmission rate. I. INTRODUCTION
Performance Analysis of Network Parameters, Throughput Optimization Using Joint Routing, XOR Routing and Medium Access Control in Wireless Multihop Network 1 Dr. Anuradha M. S., 2 Ms. Anjali kulkarni 1
More informationEfficient Data Aggregation in Multi-hop WSNs
Efficient Data Aggregation in Multi-hop WSNs XiaoHua Xu, ShiGuang Wang, XuFei Mao, ShaoJie Tang, Ping Xu, Xiang-Yang Li Abstract Data aggregation is a primitive communication task in wireless sensor networks
More informationA Survey on Scheduling Algorithms for Wireless Sensor Networks
A Survey on Scheduling Algorithms for Wireless Sensor Networks Sumit Kumar M.Tech Scholar Department of Computer Science and Engineering, National Institute of Technology, Hamirpur (H.P.), India Siddhartha
More informationHeterogeneity Increases Multicast Capacity in Clustered Network
Heterogeneity Increases Multicast Capacity in Clustered Network Qiuyu Peng Xinbing Wang Huan Tang Department of Electronic Engineering Shanghai Jiao Tong University April 15, 2010 Infocom 2011 1 / 32 Outline
More informationDistributed Data Aggregation Scheduling in Wireless Sensor Networks
Distributed Data Aggregation Scheduling in Wireless Sensor Networks Bo Yu School of Computer Science and Technology, Harbin Institute of Technology, China Email: bo yu@hit.edu.cn Jianzhong Li School of
More informationEnergy-Efficient Opportunistic Topology Control in Wireless Sensor Networks
Energy-Efficient Opportunistic Topology Control in Wireless Sensor Networks Jian Ma, Qian Zhang, Chen Qian, and Lionel M. Ni Department of Computer Science and Engineering Hong Kong University of Science
More informationDISCOVERING OPTIMUM FORWARDER LIST IN MULTICAST WIRELESS SENSOR NETWORK
DISCOVERING OPTIMUM FORWARDER LIST IN MULTICAST WIRELESS SENSOR NETWORK G.Ratna kumar, Dr.M.Sailaja, Department(E.C.E), JNTU Kakinada,AP, India ratna_kumar43@yahoo.com, sailaja.hece@gmail.com ABSTRACT:
More informationA CLASSIFICATION FRAMEWORK FOR SCHEDULING ALGORITHMS IN WIRELESS MESH NETWORKS Lav Upadhyay 1, Himanshu Nagar 2, Dharmveer Singh Rajpoot 3
A CLASSIFICATION FRAMEWORK FOR SCHEDULING ALGORITHMS IN WIRELESS MESH NETWORKS Lav Upadhyay 1, Himanshu Nagar 2, Dharmveer Singh Rajpoot 3 1,2,3 Department of Computer Science Engineering Jaypee Institute
More informationOn the Minimum k-connectivity Repair in Wireless Sensor Networks
On the Minimum k-connectivity epair in Wireless Sensor Networks Hisham M. Almasaeid and Ahmed E. Kamal Dept. of Electrical and Computer Engineering, Iowa State University, Ames, IA 50011 Email:{hisham,kamal}@iastate.edu
More informationConnection-Level Scheduling in Wireless Networks Using Only MAC-Layer Information
Connection-Level Scheduling in Wireless Networks Using Only MAC-Layer Information Javad Ghaderi, Tianxiong Ji and R. Srikant Coordinated Science Laboratory and Department of Electrical and Computer Engineering
More informationDynamic Conflict-free Query Scheduling for Wireless Sensor Networks
Washington University in St. Louis Washington University Open Scholarship All Computer Science and Engineering Research Computer Science and Engineering Report Number: WUCSE-6-6-- Dynamic Conflict-free
More informationRouting and Channel Assignment for Multicast in Multi- Channel Multi-Radio Wireless Mesh Networks
Routing and Channel Assignment for Multicast in Multi- Channel Multi-Radio Wireless Mesh Networks Wen-Xiao Shi, Ke-Qiang Cui, and Yuan Chai College of Communication Engineering, Jilin University, Changchun,
More informationLifetime Analysis of Random Event-Driven Clustered Wireless Sensor Networks. Presented by Yao Zheng
Lifetime Analysis of Random Event-Driven Clustered Wireless Sensor Networks Presented by Yao Zheng Contributions Analyzing the lifetime of WSN without knowing the lifetime of sensors Find a accurate approximation
More informationE-Darwin2: A Smartphone Based Disaster Recovery Network using WiFi Tethering
E-Darwin2: A Smartphone Based Disaster Recovery Network using WiFi Tethering Amitangshu Pal and Krishna Kant Computer and Information Sciences, Temple University, Philadelphia, PA 19122 E-mail:{amitangshu.pal,kkant}@temple.edu
More informationA Low Latency Data Transmission Scheme for Smart Grid Condition Monitoring Applications 28/05/2012
1 A Low Latency Data Transmission Scheme for Smart Grid Condition Monitoring Applications I R F A N S. A L - A N B A G I, M E L I K E E R O L - K A N T A R C I, H U S S E I N T. M O U F T A H U N I V E
More informationPolynomial-Time Approximation Scheme for Minimum Connected Dominating Set in Ad Hoc Wireless Networks. Technical Report
Polynomial-Time Approximation Scheme for Minimum Connected Dominating Set in Ad Hoc Wireless Networks Technical Report Department of Computer Science and Engineering University of Minnesota 4-192 EECS
More informationFault-Aware Flow Control and Multi-path Routing in Wireless Sensor Networks
Fault-Aware Flow Control and Multi-path Routing in Wireless Sensor Networks X. Zhang, X. Dong Shanghai Jiaotong University J. Wu, X. Li Temple University, University of North Carolina N. Xiong Colorado
More informationWorld Journal of Engineering Research and Technology WJERT
wjert, 2018, Vol. 4, Issue 4, 527-537. Original Article ISSN 2454-695X Mukhtiar et al. WJERT www.wjert.org SJIF Impact Factor: 5.218 RPD: RELIABLE PACKETS DELIVERY CONGESTION CONTROL SCHEME IN WIRELESS
More informationAn Asynchronous and Adaptive Quorum Based MAC Protocol for Wireless Sensor Networks
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING XX, XXX-XXX (2013) An Asynchronous and Adaptive Quorum Based MAC Protocol for Wireless Sensor Networks 1 L. SHERLY PUSPHA ANNABEL AND 2 K. MURUGAN 1 Department
More informationMinimum-Latency Aggregation Scheduling in Wireless Sensor Networks under Physical Interference Model
Minimum-Latency Aggregation Scheduling in Wireless Sensor Networks under Physical Interference Model Hongxing Li Department of Computer Science The University of Hong Kong Pokfulam Road, Hong Kong hxli@cs.hku.hk
More informationClustering-Based Distributed Precomputation for Quality-of-Service Routing*
Clustering-Based Distributed Precomputation for Quality-of-Service Routing* Yong Cui and Jianping Wu Department of Computer Science, Tsinghua University, Beijing, P.R.China, 100084 cy@csnet1.cs.tsinghua.edu.cn,
More informationTopology Control in 3-Dimensional Networks & Algorithms for Multi-Channel Aggregated Co
Topology Control in 3-Dimensional Networks & Algorithms for Multi-Channel Aggregated Convergecast Amitabha Ghosh Yi Wang Ozlem D. Incel V.S. Anil Kumar Bhaskar Krishnamachari Dept. of Electrical Engineering,
More informationConnected Dominating Set in Sensor Networks and MANETs
Handbook of Combinatorial Optimization D.-Z. Du and P. Pardalos (Eds.) pp. 329-369 c 2004 Kluwer Academic Publishers Connected Dominating Set in Sensor Networks and MANETs Jeremy Blum Min Ding Andrew Thaeler
More informationGATEWAY MULTIPOINT RELAYS AN MPR-BASED BROADCAST ALGORITHM FOR AD HOC NETWORKS. Ou Liang, Y. Ahmet Şekercioğlu, Nallasamy Mani
GATEWAY MULTIPOINT RELAYS AN MPR-BASED BROADCAST ALGORITHM FOR AD HOC NETWORKS Ou Liang, Y. Ahmet Şekercioğlu, Nallasamy Mani Centre for Telecommunication and Information Engineering Monash University,
More informationA New Scheduling Algorithm for Reducing Data Aggregation Latency in Wireless Sensor Networks *
Int. J. Communications, Network and System Sciences, 2010, 3, 679-688 doi:10.4236/ijcns.2010.38091 Published Online August 2010 (http://www.scirp.org/journal/ijcns) A New Scheduling Algorithm for Reducing
More informationImplementation of an Algorithmic To Improve MCDS Based Routing In Mobile Ad-Hoc Network By Using Articulation Point
International Journal of Computational Engineering Research Vol, 03 Issue5 Implementation of an Algorithmic To Improve MCDS Based Routing In Mobile Ad-Hoc Network By Using Articulation Point Shalu Singh
More informationEfficient Data Aggregation in Multi-hop WSNs
1 Efficient Data Aggregation in Multi-hop WSNs XiaoHua Xu, ShiGuang Wang, XuFei Mao, ShaoJie Tang, Ping Xu, XiangYang Li Abstract Data aggregation is a key functionality for wireless sensor network (WSN)
More informationDynamic Traffic Congestion Control Scheme in MANET with Cooperative Communication
Dynamic Traffic Congestion Control Scheme in MANET with Cooperative Communication P.Deepa 1, Dr. P.S.K Patra 2 1 Department of Computer Science and Engineering, 2 Head of the Department, Agni College of
More informationAn Energy-Efficient Distributed Algorithm for Minimum-Latency Aggregation Scheduling in Wireless Sensor Networks
An Energy-Efficient Distributed Algorithm for Minimum-Latency Aggregation Scheduling in Wireless Sensor Networks Yingshu Li, Longjiang Guo, and Sushil K. Prasad Department of Computer Science Georgia State
More informationAN EFFICIENT MAC PROTOCOL FOR SUPPORTING QOS IN WIRELESS SENSOR NETWORKS
AN EFFICIENT MAC PROTOCOL FOR SUPPORTING QOS IN WIRELESS SENSOR NETWORKS YINGHUI QIU School of Electrical and Electronic Engineering, North China Electric Power University, Beijing, 102206, China ABSTRACT
More informationIs Topology-Transparent Scheduling Really Inefficient in Static Multihop Networks? IEEE Wireless Communications Letters, 2013, v. 2 n. 6, p.
Title Is Topology-Transparent Scheduling Really Inefficient in Static Multihop Networks? Author(s) Liu, Y; Li, VOK; Leung, KC; Zhang, L Citation IEEE Wireless Communications Letters, 2013, v. 2 n. 6, p.
More informationADHOC SYSTEMSS ABSTRACT. the system. The diagnosis strategy. is an initiator of. can in the hierarchy. paper include. this. than.
Journal of Theoretical and Applied Information Technology 2005-2007 JATIT. All rights reserved. www.jatit.org A HIERARCHICAL APPROACH TO FAULT DIAGNOSIS IN LARGE S CALE SELF-DIAGNOSABLE WIRELESS ADHOC
More informationRouting protocols in WSN
Routing protocols in WSN 1.1 WSN Routing Scheme Data collected by sensor nodes in a WSN is typically propagated toward a base station (gateway) that links the WSN with other networks where the data can
More informationTime-Bounded Essential Localization for Wireless Sensor Networks
IEEE TRANSACTIONS ON NETWORKING 1 Time-Bounded Essential Localization for Wireless Sensor Networks Wei Cheng, Member, IEEE, Nan Zhang, Member, IEEE, Xiuzhen Cheng, Senior Member, IEEE, Min Song, Senior
More informationThe 2010 IEEE Wireless Communications and Networking Conference (WCNC), Sydney, Australia, April In Proceedings of WCNC, 2010, p.
Title A joint routing and scheduling algorithm for efficient broadcast in wireless mesh networks Author(s) Chiu, HS; Yeung, KL Citation The 2 IEEE Wireless Communications and Networking Conference (WCNC),
More informationNodes Energy Conserving Algorithms to prevent Partitioning in Wireless Sensor Networks
IJCSNS International Journal of Computer Science and Network Security, VOL.17 No.9, September 2017 139 Nodes Energy Conserving Algorithms to prevent Partitioning in Wireless Sensor Networks MINA MAHDAVI
More informationEfficient Self Protection Algorithms for Wireless Sensor Networks
Efficient Self Protection Algorithms for Wireless Sensor Networks Yu Wang Dept. of Computer Science University of North Carolina at Charlotte Charlotte, NC 28223, USA Email: ywang32@uncc.edu Xiang-Yang
More informationDistributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks
Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks Peng-Jun Wan Khaled M. Alzoubi Ophir Frieder Abstract Connected dominating set (CDS) has been proposed as virtual backbone
More informationChapter 8 DOMINATING SETS
Chapter 8 DOMINATING SETS Distributed Computing Group Mobile Computing Summer 2004 Overview Motivation Dominating Set Connected Dominating Set The Greedy Algorithm The Tree Growing Algorithm The Marking
More informationA MAC Protocol based on Dynamic Time Adjusting in Wireless MIMO Networks
212 7th International ICST Conference on Communications and Networking in China (CHINACOM) A MAC Protocol based on Dynamic Time Adjusting in Wireless MIMO Networks Yang Qin*, Xiaoxiong Zhong, Li Li, Zhenhua
More informationA 2k-Kernelization Algorithm for Vertex Cover Based on Crown Decomposition
A 2k-Kernelization Algorithm for Vertex Cover Based on Crown Decomposition Wenjun Li a, Binhai Zhu b, a Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation, Changsha
More informationConnected Point Coverage in Wireless Sensor Networks using Robust Spanning Trees
Connected Point Coverage in Wireless Sensor Networks using Robust Spanning Trees Pouya Ostovari Department of Computer and Information Siences Temple University Philadelphia, Pennsylvania, USA Email: ostovari@temple.edu
More informationThe Effect of Neighbor Graph Connectivity on Coverage Redundancy in Wireless Sensor Networks
The Effect of Neighbor Graph Connectivity on Coverage Redundancy in Wireless Sensor Networks Eyuphan Bulut, Zijian Wang and Boleslaw K. Szymanski Department of Computer Science and Center for Pervasive
More informationLocalized Algorithms for Energy Efficient Topology in Wireless Ad Hoc Networks
Localized Algorithms for Energy Efficient Topology in Wireless Ad Hoc Networks Wen-Zhan Song Yu Wang Xiang-Yang Li Ophir Frieder Abstract. Topology control in wireless ad hoc networks is to select a subgraph
More informationChapter 8 DOMINATING SETS
Distributed Computing Group Chapter 8 DOMINATING SETS Mobile Computing Summer 2004 Overview Motivation Dominating Set Connected Dominating Set The Greedy Algorithm The Tree Growing Algorithm The Marking
More informationCooperative and Opportunistic Transmission for Wireless Ad Hoc Networks. IEEE Network, Jan./Feb., 2007 Jeng-Long Chiang Nov.
Cooperative and Opportunistic Transmission for Wireless Ad Hoc Networks IEEE Network, Jan./Feb., 2007 Jeng-Long Chiang Nov. 8, 2007 Outline Introduction Distributed Cooperative Rate Adaption (DCRA) DCRA
More informationNetworking Sensors, II
Networking Sensors, II Sensing Networking Leonidas Guibas Stanford University Computation CS321 ZG Book, Ch. 3 1 Class Administration Paper presentation preferences due today, by class time Project info
More informationUsing Hybrid Algorithm in Wireless Ad-Hoc Networks: Reducing the Number of Transmissions
Using Hybrid Algorithm in Wireless Ad-Hoc Networks: Reducing the Number of Transmissions R.Thamaraiselvan 1, S.Gopikrishnan 2, V.Pavithra Devi 3 PG Student, Computer Science & Engineering, Paavai College
More informationANALYZE AND EVALUATE THE IMPLEMENTATION OF CDS ALGORITHMS USING THE MOBILE AGENT.. 1 RAFAT AHMED ALHANANI, 2 JAAFAR ABOUCHABAKA, 3 RAFALIA NAJAT
ANALYZE AND EVALUATE THE IMPLEMENTATION OF CDS ALGORITHMS USING THE MOBILE AGENT.. 1 RAFAT AHMED ALHANANI, 2 JAAFAR ABOUCHABAKA, 3 RAFALIA NAJAT 1 2 3 Department of Computer Science, IBN Tofail University,
More informationMobile Agent Driven Time Synchronized Energy Efficient WSN
Mobile Agent Driven Time Synchronized Energy Efficient WSN Sharanu 1, Padmapriya Patil 2 1 M.Tech, Department of Electronics and Communication Engineering, Poojya Doddappa Appa College of Engineering,
More informationOn Performance Evaluation of Reliable Topology Control Algorithms in Mobile Ad Hoc Networks (Invited Paper)
On Performance Evaluation of Reliable Topology Control Algorithms in Mobile Ad Hoc Networks (Invited Paper) Ngo Duc Thuan 1,, Hiroki Nishiyama 1, Nirwan Ansari 2,andNeiKato 1 1 Graduate School of Information
More informationMobile Data Gathering with Time-Constraints in Wireless Sensor Networks
Mobile Data Gathering with Time-Constraints in Wireless Sensor Networks Xuming Yin, Jinghua Zhu, Yingshu Li, and Zhiqiang Wu School of Computer Science and Technology, Heilongjiang University, Harbin,
More informationThroughput-Optimal Broadcast in Wireless Networks with Point-to-Multipoint Transmissions
Throughput-Optimal Broadcast in Wireless Networks with Point-to-Multipoint Transmissions Abhishek Sinha Laboratory for Information and Decision Systems MIT MobiHoc, 2017 April 18, 2017 1 / 63 Introduction
More informationLocalized Algorithms for Energy Efficient Topology in Wireless Ad Hoc Networks
Localized Algorithms for Energy Efficient Topology in Wireless Ad Hoc Networks Wen-Zhan Song Yu Wang Xiang-Yang Li Ophir Frieder ABSTRACT We propose several novel localized algorithms to construct energy
More informationOptimizing the Data Collection in Wireless Sensor Network
Optimizing the Data Collection in Wireless Sensor Network R.Latha 1,Valarmathi.M 2 1 Assistant Professor, 2 PG Scholar 1,2 Computer Application 1,2 Vel Tech High Tech DR.Rangarajan DR.Sakunthala Engineering
More informationWireless Sensor Networks 22nd Lecture
Wireless Sensor Networks 22nd Lecture 24.01.2007 Christian Schindelhauer schindel@informatik.uni-freiburg.de 1 Options for topology control Topology control Control node activity deliberately turn on/off
More informationBandwidth Constrained Multicast Routing for TDMA- Based Mobile Ad Hoc Networks
andwidth Constrained Multicast Routing for TDMA- ased Mobile Ad Hoc Networks Xu Zhen and Zhou Long School of Electric & Electronic Engineering, Wuhan Polytechnic University, Wuhan, China Email: 1 xuzhen@whu.edu.cn,
More information