Optimal Backbone Generation for Robotic Relay Networks
|
|
- Stephen Williams
- 6 years ago
- Views:
Transcription
1 Optimal Backbone Generation for Robotic Relay Networks Ying Zhang Palo Alto Research Center Inc Coyote Hill Rd Palo Alto, CA 9434, USA s: Mark Quilling Lockheed Martin Space Systems Center 1111 Lockheed Martin Way Sunnyvale, CA, 9489, USA Abstract There has been a growing interest in robotic relay networks for applications in dangerous and hazardous environments. In particular, a team of robots with onboard radios deployed in an unknown environment would coordinate to form an ad-hoc relay network that maximizes the connectivity to transmit data from a set of unknown data s to a gateway. In this paper, we present a problem and solutions to minimize the number of stationary relay nodes given a set of unknown but stationary s. The goal is to maximize the number of free robots to search for more unknown s to extend the connectivity of the network, while keeping the communications to the existing connected s. We present two types of algorithms: OLQ (Optimal Link Quality) and AST (Approximate Steiner Tree), and analyze their performance in various routing metrics. The algorithms have been developed in a real robotic platform and demonstrated in multi-floor indoor environments. keywords: robotic relay networks, spanning trees, approximate Steiner trees, optimal backbones I. INTRODUCTION There has been a growing interest in robotic relay networks for applications in dangerous and hazardous environments. One of the challenging research issues is to develop strategies for robots to form a reliable communication relay network to support human operations in an indoor Non Line Of Sight (NLOS) environment such as buildings, rubbles, caves and other urban terrains. In particular, a team of small and lowcost robots (Fig. 1) with onboard radios deployed in an unknown environment would coordinate to form an ad-hoc relay network that maintains the connectivity to transmit data from a set of unknown data s to a gateway. In this paper, we focus on a problem of establishing an optimal backbone for a relay network for the connected data s in a sense that the number of robots used in the backbone is minimized. The goal is for more robots to search for unknown s and connect as many s as possible so that the overall data throughput in a given period of time is maximized. The motion strategy of searching for data s is out of the scope of this paper. The robots in this study are icreates and LANdroids (Fig. 2) from irobot Corporation ( with SR71 USB radios. A version of OLSR (Optimal Link State Routing: is used as the protocol for data transmissions from the data s to the gateway. The system uses Fig. 1. A robotic team, consisting of LANdroids, each of which is equipped with an onboard radio. neighbor discovery in OLSR and propagates the neighboring connectivity to build a global radio matrix, i.e., a pairwise radio connectivity matrix of the connected radios. We have developed a protocol to disseminate the radio matrix to each node that guarantees that such a radio matrix is consistent for all the nodes in the connected network. This consistency is important for global solution consistency with local computation. The protocol consists of two phases. In the first phase, all nodes broadcast hello packets a couple of times while averaging received radio signal strength for each neighbor. Phase one ends when no more packets received after certain time, by which time, each node has a neighbor table with signal strengths from all its neighbors. The second phase disseminates the neighbor table to form a radio matrix. Each node assembles all the pairwise connections it has received and broadcasts the list. The second phase ends when no new connections are received. Our application does not involve hundred thousands of nodes as many other sensor network applications, therefore this protocol works well for our purpose. Using such a radio matrix, each node will compute the optimal backbone. Since all nodes use the same data, the optimal solution is the same. The nodes that do not belong to the backbone are free to move for searching other radios in the environment /11/$ IEEE
2 II. PROBLEM DEFINITIONS Fig. 2. icreate (left) and LANdroid (right) from irobot Corporation Building a backbone for a subset of nodes in a network using minimum number of relay nodes is a Steiner Tree problem [4]. We propose two algorithms for computing such backbones: OLQ (Optimal Link Quality) uses minimum spanning tree heuristics that produces backbones with the best link quality defined by signal strength, AST (Approximate Steiner Tree) uses shortest path heuristics that produces backbones with minimum number of hops from s to the gateway. Variations of the algorithms are also proposed to further improve the performance metrics. Various research has been done for creating optimal spanning trees in wireless ad hoc networks for transmitting data to a gateway, e.g., work in [7] focused on routing with minimum power given data s and transmission frequency, using approximate algorithms of Steiner trees. The requirement for this work is different since we are more interested using minimum number of relay nodes, while keeping the number of hops small and signal strength high. The AST algorithm, however, is similar to ISTH in [7]. The OLQ algorithm uses the minimum spanning tree algorithm, with weights as a function of signal strength. The contributions of this paper is on the application of these algorithms, not the algorithms of themselves. There also has been work on optimization for mobile backbone networks [1][6], however, the focus of their research is on how to place the mobile nodes among the static nodes to achieve connectivity and maximum throughput. Similar work has been done in [2] to control the mobility of robots for minimum power consumption in terms of both communication and motion power usage. In our case, we try to find out which nodes should stay in place and which can move, not how to control the mobility of the mobile nodes, and we do not assume robots have the knowledge of their geographical locations. There has been work in building spanning tree for maximum throughput in P2P live media streaming [5], which maximize minimum node throughput. Here we assume the data rate is much smaller than the maximum throughput a node can support, therefore there is no restriction on the number of children as in [5]. The rest of the paper is organized as follows. Section II describes the problem with assumptions and performance metrics. Section III presents the Optimal Link Quality algorithm and Section IV develops the Approximate Steiner Tree algorithm. Section V analyzes performance of both algorithms via simulations and Section VI illustrates a real test scenario in a multi-floor office environment. Section VII concludes the paper. We consider a set of unknown but static data s S in an environment, each of which is transmitting data to a gateway g at a constant rate. Given a set of robotic relay nodes R, our ultimate goal is to control the mobility of relay nodes in a way so that all data s can reach the gateway. We assume, however, the total data rate from all the data s is less than the maximum throughput that a node can support, i.e., there is no limitation on the number of s a node can relay from. This may not seem scaleable, but it is the case in our real scenarios. We have about 1-15 relay nodes, 3-1 data s, and one gateway node. Each data sends 1.5 Mega bits data per second to the gateway as soon as they are deployed. We do not assume robots or data s location-awareness. Given an initial deployment scenario of the robots, only a subset of data s are connected to the gateway through the robotic relay nodes. In order to search for more data s, robots have to explore the environment to locate the additional radio s. We decompose this problem into two subproblems: (1) which robots can move and which should stay in place in order to relay the connected data s, and (2) for those can move, how to explore the environment in an efficient way. This paper focuses on the first problem. We formulate the first problem as an optimal backbone generation problem. Given a graph G = V,E, where V = R S {g} and E is the radio matrix, such that E(u, v) is the signal strength from node u to v. If v cannot receive radio signal from u, E(u, v) =. In our real platform experiments, the non-zero signal strength ranges from 16 to 7, with larger values indicate higher signal strengths. The connections with small signal strengths are not very reliable and may cause large data loss. We say a link exists from u to v, if and only if E(u, v) L where L is a threshold of the signal strength for reliable data transmission. A data s S is connected to the gateway g, if and only if there is a path from s to g in G. Most routing protocols require bidirectional links. In practice, links are asymmetric, i.e., E(u, v) E(v, u). To get symmetric links from asymmetric links, instead of averaging the two signal strength from both directions, we set E(u, v) and E(v, u) to be the minimum signal strength of the two directions, so that one directional links are removed and the routing protocol is more robust. The problem of backbone generation is to find a tree T G, such that T = V,E, with V V and E E, and V includes g and all data s in S that are connected to g and a subset of relay nodes in R (Fig. 3), which we call backbone nodes. In addition, we prefer links in the backbone with high signal strengths and the number of hops from data s to the gateway small. In summary, we consider three objectives: (1) minimum number of backbone nodes, (2) maximum signal strength for backbone links, and (3) minimum hops from s to the gateway, with the order that (1) has higher priority than (2) and (3). This three objectives will be used as performance metrics for comparing different algorithms.
3 Fig. 3. Backbone example: thick lines indicate backbone links The primary goal, i.e., finding a spanning tree covering a subset of nodes with minimum number of relay nodes (or minimum weight assuming each link has the same weight) is a Steiner Tree problem, which is NP-hard [3]. We developed two types of approximate algorithms: Optimal Link Quality (OLQ) uses the minimum spanning tree heuristics and Approximate Steiner Tree (AST) uses the shortest path heuristics. III. OPTIMAL LINK QUALITY ALGORITHM We associate link weight w(u, v) to each link E(u, v), the lower the weight, the higher the quality. Let L be the threshold of signal strengths, below which, the data loss is high, and O be the value of signal strength, above which, the data loss is low, and M is the maximum signal strength, L O M. The link weight is defined as follows: { α(e(u, v) O) if E(u, v) O w(u, v) = (1) β(o E(u, v)) if E(u, v) <O where α> and β>, and α(m O) β(o L). (2) A minimum spanning tree rooted at g is then generated given the weights on the links. The algorithm first orders all the weights from minimum to maximum. Starting from the gateway g T, each time a node v is selected to add to T if u T and v T and w(u, v) is the smallest among all the possible choices of u and v, link (u, v) is then added to T. This weight function prefers links close to the optimal value O, because with this value, two nodes are not too close to each other, while link quality is good enough. If signal strength is below the critical threshold L, its weight would be larger than the weights of links whose signal strength are above L given relation (2). Links with signal strength below threshold are not chosen unless nothing else can be used for building the tree. After building the minimum spanning tree, we repeatedly remove relay nodes that are leaves, until nothing can be removed. What left is the backbone which connects existing s to the gateway. What removed are free nodes that can be used for exploring more data s. Theorem 1: Let L m be the minimum signal strength in the backbone tree generated from the weight function defined by Eq. (1). If L m <L, the network is not connected. Proof: Let L m <Lbe the signal strength of a link between u and v, i.e., (u, v) in the spanning tree, there is no path from u to v with signal strength at or above L. This can be proved by contradiction. If there exists a path from u to v with the minimal signal strength of the links in the path L, weights of these links are smaller than the weight of (u, v), therefore, those links would be used instead of link (u, v) for the backbone. Note that if O = M, the algorithm would build a spanning tree with strongest minimum signal strength, which may use more relay nodes. On the other hand if O is close to L, the algorithm would build a tree that prefers low signal strength, resulting possibly less relay nodes. From our real platform experiments, we found that 23 <O<3 seems to work the best, such that the links chosen are reliable while keeping the number of backbone nodes small. Theorem 2: If O = M, the minimum signal strength of the backbone tree is maximized among all possible backbone trees. Proof: Links with the highest signal strength will be picked to build the tree. Note that when O < M, this algorithm may generate path with larger number of hops using weaker links closer to optimal weights. A variation of the spanning tree algorithm for this problem is as follows: Starting from the gateway g T, each time a node v is selected to add to T if u T and v T and w(u, v) is the smallest among all the possible choices of u and v. Instead of adding link (u, v) to T, link (u, t) is added to T given that E(u, t) is the highest among all nodes of t T. We call this variation OLQm. IV. APPROXIMATE STEINER TREE ALGORITHM Similar to OLQ, we associate a link weight w(u, v) to each link E(u, v), 1 if E(u, v) L E(u,v) w(u, v) = n (3) if E(u, v) <L E(u,v) where n = V is the total number of nodes. The algorithm first computes the shortest path from every node v to the gateway g using the weight functions given by Eq. (3). Let d(v, g) be the distance of the shortest path from v to g. For each node v, let p(v) be a penalty to select v, which is a small constant c, c< 1 L,ifv is not a parent of a node yet. Initially, p(v) is c for all nodes. Order all nodes in increasing order with respect to their shortest distance to the gateway. For every node v in that order, select a neighbor u to be its parent, if and only if (1) d(u, g) <d(v, g) and (2) d(v, u) +d(u, g) +p(u) is minimum. Then set p(u) =since u is a parent (of v). The algorithm finishes when every node except g has a parent.
4 After repeatedly removing relay nodes that are leaves, what left is a backbone tree. This algorithm prefers to select a parent that is already a parent given the same shortest path distance, resulting possibly less relay nodes in the backbone. This weight function, Eq. (3), has a good property: Theorem 3: For any node, the path with minimum distance to the gateway has the number of hops to the gateway bounded by a constant factor of the minimum number of hops. In M particular, the constant is k L, where L and M are minimum and maximum signal strength, respectively. Proof: Let h be the minimum number of hops with distance D and H be the number of hops with minimum distance d, from a node to the gateway, i.e., h H and d D. Also, assume m is the maximum and l is the minimum signal strength in H this network, m d and D h H l. Therefore, m h l, i.e., H m l h.letk = m l, since m M and l L, M k L. Since the penalty for non-parent nodes p(v) is a small constant < 1 L, it prefers parent-sharing without losing too much on link quality, or adding one extra hop. We can also incorporate the information of the existing routing structure to reduce the time of re-routing. To achieve this, we let p(v) be the penalty function of node v: p(v) is c if it is not a relay node in the current routing and is otherwise. The link threshold L is sometimes hard to set. If L is set too low, it may create a tree with weak links. On the other hand, if it is too high, one may use many relay nodes and the network may be fragmented. We can alleviate this problem by given a range [L min,l max ] and set L min L L max as follows: First run OLQ with O = M and find out the weakest link in the tree with signal strength L m. Then set L by Eq. (4). L m if L min L m L max L = L min if L m <L min (4) L max if L m >L max L min indicates the lower bound, below which there is a large data loss, and L max is set to trade-off the quality of links and the number of relay nodes. In our real platform experiments, L [18, 22] works good. Theorem 4: The backbone will connect all nodes if and only if L m L min. Proof: Let L m be the signal strength between u and v. If L m <L min, there is no connection between u and v with signal strength at or above L min, therefore it is not connected. Otherwise, there will be a connection above or at L L m between any two nodes. V. PERFORMANCE ANALYSIS We have analyzed the performance of these two algorithms with their variations, using simulations of radio networks: OLQ: Optimal Link Quality; OLQm: Optimal Link Quality with maximum strength link extension; AST: Approximate Steiner Tree without penalty to new patents; gateway Fig. 4. Example of a network and backbone using AST. Red lines indicate walls that divide the area AST: Approximate Steiner Tree with penalty to new parents. For each algorithm, we compute three performance metrics: BNs: the number of backbone nodes from data s to the gateway; mss: the minimum signal strength of all the links used in the backbone; MHs: the maximum number of hops from any data s to the gateway. The simulation creates an indoor environment 4m by 4m in size, with walls dividing the areas. A gateway is placed at an entrance, and four data s are located at four corners. About 4+ robotic nodes are deployed at the leftlower corner of the area. A simple radio model is used to create the radio matrices, i.e., pair-wise signal strengths. Signals across each wall are reduced by a constant factor and signals less than a threshold are cut off and set as. Signal strengths range from 16 to 7 to match our real experiment data. Fig. 4 shows a scenario, where lines indicate communication pairs, thick lines are branches of the backbone tree. By running the algorithms, the system is able to figure out which robots to act as backbone nodes and which can go to explore the environment to find the fourth data. One hundred random test cases are generated to run all four algorithms. For OLQs, we have set O =25, α =1and β =2.ForASTs,wehavesetL =2and c =.25. The performance metrics for the four algorithms are shown in Fig. 5, Fig. 6, and Fig. 7, respectively. These figures are histograms, so that X-axes are the performance measurements of that performance metric and Y-axes are number of occurrences for such a measurement. The plots indicate rough probability distributions for the given metrics. They are more informed than simply average and standard deviation numbers. Here is the summary of the performance of the four algorithms.
5 3 OLQ 3 OLQm 4 OLQ 4 OLQm AST 5 AST 6 AST 6 AST Fig. 5. Histograms of the number of backbone nodes (BNs) Fig. 7. Histograms of the maximum number of hops (MHs) OLQ AST Fig OLQm AST Histograms of the minimum signal strength (mss) For the number of backbone nodes, our main objective, AST is the best, which is slightly better than AST. OLQm is a lot better than OLQ, however, both perform a lot worse than ASTs. For the minimum signal strength, OLQm has the best profile, which is better than OLQ, both are better than ASTs. For the maximum number of hops from s, similar to the number of backbone nodes, AST is slightly better than AST. OLQm is a lot better than OLQ, however, both perform a lot worse than ASTs. From those performance data, we see that AST is a better choice for this application. AST and OLQ can be combined in the sense that OLQ can be used to set L forast,aswe described in Section IV. VI. REAL EXPERIMENTS We have implemented these algorithms in C++/Linux on microprocessors in icreates and LANdroids, with SR71 USB radios (Fig. 2), as part of the software suite for the LANdroids platform. We have tested the system in multiple multi-floor buildings. Fig. 8 is a scenario where total of 18 nodes are deployed in two floors of an office building, 1 gateway, 4 data s, and 13 robotic relay nodes. This figure shows the result of backbone using AST. In this case, there are 6 backbone nodes, and 7 free nodes. The maximum number of hops from a to the gateway is 4. And the minimum signal strength in the backbone is 31, which is way above the minimum threshold. From those experiments, we learn that the signal strengths have little to do with distance between two nodes; they are related to the locations of nodes in a very complex way (signal amplifications and reflections in indoor environments) and transmitter/receiver battery levels. The only reliable information is the radio matrix itself, which our algorithms are based upon. VII. CONCLUSIONS We have presented in this paper some algorithms for creating a backbone using minimum number of robotic relay nodes, which is important so that more robots can be used for exploring the environment to search for unknown s. Analysis in simulations has shown that AST is the best algorithm in this aspect, in terms of the performance metrics we care about. We have implemented these algorithms in real robotic platforms and tested in various indoor multifloor environments. Although there has been related work on spanning trees for networks, our problem has some special features of its own. Since the robotic relay networks are relatively new, we have not seen existing algorithms for our application to compare our algorithms with. Motion planning and control have also been developed to use with the backbone generation, however, it is out of the scope of this paper.
6 Fig. 8. Scenario: the backbone is shown in dark thick lines and connectivity is shown in thin lines. Nodes with dark borders are backbone nodes and others are free nodes. Numbers by the data s show the number of hops to the gateway through the backbone. More variations of these algorithms can be developed. For example, for AST, adding a general penalty function giving the number of existing children, in which case, one encourages sharing parents up to a maximum number and discourages further children if throughput is limited. Another approach is to simultaneously optimize all three performance metrics, for example, discovering the value of L in AST that is best overall for all three metrics. We can also use as many existing relay nodes as possible to avoid re-routing, which will reduce data loss significantly. These algorithms are independent to any type of routing protocols one may use for data communications. ACKNOWLEDGEMENT This work was sponsored by the Defense Advanced Project Research Agency (DARPA) contract #FA865-8-C-7814, LANdroids ( REFERENCES [1] E. M. Craparo, J. P. How, and E. Modiano, Optimization of mobile backbone networks: Improved algorithms and approximation, in Proceedings of American Control Conference, 28. [2] F. El-Moukaddem, E. Torng, and G. Xing, Mobile relay configuration in data-intensive wireless sensor networks, in IEEE International Conference on Mobile Ad-hoc and Sensor Systems, 29. [3] M. R. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., 199. [4] E. N. Gilbert and H. O. Pollak, Steiner minimal trees, SIAM Applied Mathematics, vol. 16, pp. 1 29, [5] X. Lu, Q. Wu, R. Li, and Y. Lin, On tree construction of super peers for hybrid P2P live media streaming, in Proceedings of International Conference on Computer Communication Networks, 21. [6] A. Srinivas, G. Zussman, and E. Modiano, Construction and maintenance of wireless mobile backbone networks, IEEE/ACM Transactions on Networking, 29. [7] G. Xing, C. Lu, Y. Zhang, Q. Huang, and R. Pless, Minimum power configuration for wireless communication in sensor networks, ACM Transactions in Sensor Networks, vol. 3, 27.
CHAPTER 2 WIRELESS SENSOR NETWORKS AND NEED OF TOPOLOGY CONTROL
WIRELESS SENSOR NETWORKS AND NEED OF TOPOLOGY CONTROL 2.1 Topology Control in Wireless Sensor Networks Network topology control is about management of network topology to support network-wide requirement.
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 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 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 informationOn Distributed Algorithms for Maximizing the Network Lifetime in Wireless Sensor Networks
On Distributed Algorithms for Maximizing the Network Lifetime in Wireless Sensor Networks Akshaye Dhawan Georgia State University Atlanta, Ga 30303 akshaye@cs.gsu.edu Abstract A key challenge in Wireless
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 informationSmart Routing with Learning-
Smart Routing with Learning- based QoS-aware Meta-strategies Ying Zhang Markus Fromherz Lukas Kuhn (Ludwig Maximilian University) October 2004 Outline Message-initiated Constraint-based Routing Learning-based
More informationApproximability Results for the p-center Problem
Approximability Results for the p-center Problem Stefan Buettcher Course Project Algorithm Design and Analysis Prof. Timothy Chan University of Waterloo, Spring 2004 The p-center
More informationModel and Algorithms for the Density, Coverage and Connectivity Control Problem in Flat WSNs
Model and Algorithms for the Density, Coverage and Connectivity Control Problem in Flat WSNs Flávio V. C. Martins, cruzeiro@dcc.ufmg.br Frederico P. Quintão, fred@dcc.ufmg.br Fabíola G. Nakamura fgnaka@dcc.ufmg.br,fabiola@dcc.ufam.edu.br
More informationTHE FIRST APPROXIMATED DISTRIBUTED ALGORITHM FOR THE MINIMUM DEGREE SPANNING TREE PROBLEM ON GENERAL GRAPHS. and
International Journal of Foundations of Computer Science c World Scientific Publishing Company THE FIRST APPROXIMATED DISTRIBUTED ALGORITHM FOR THE MINIMUM DEGREE SPANNING TREE PROBLEM ON GENERAL GRAPHS
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 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 informationEfficient Broadcasting in Ad Hoc Wireless Networks Using Directional Antennas
Efficient Broadcasting in Ad Hoc Wireless Networks Using Directional Antennas Fei Dai and Jie Wu Department of Computer Science and Engineering Florida Atlantic University Boca Raton, FL 3343 Abstract
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 informationDeployment of a Reinforcement Backbone Network with Constraints of Connection and Resources
Deployment of a Reinforcement Backbone Network with Constraints of Connection and Resources Peng Wei, Shan Chu, Xin Wang and Yu Zhou State University of New York at Stony Brook Stony Brook, NY 11794, USA
More informationAd hoc and Sensor Networks Topology control
Ad hoc and Sensor Networks Topology control Goals of this chapter Networks can be too dense too many nodes in close (radio) vicinity This chapter looks at methods to deal with such networks by Reducing/controlling
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 informationDynamic Cooperative Routing (DCR) in Wireless Sensor Networks
Dynamic Cooperative Routing () in Wireless Sensor Networks Sivasankari H. 1, Leelavathi R. 1, Shaila K. 1, Venugopal K.R. 1, S.S. Iyengar 2, and L.M. Patnaik 3 1 Department of Computer Science and Engineering,
More informationBackbone Discovery In Thick Wireless Linear Sensor Netorks
Backbone Discovery In Thick Wireless Linear Sensor Netorks October 28, 2014 Imad Jawhar1, Xin Li2, Jie Wu3, and Nader Mohamed1 1 College of Information Technology, United Arab Emirates University, Al Ain,
More informationDynamic Design of Cellular Wireless Networks via Self Organizing Mechanism
Dynamic Design of Cellular Wireless Networks via Self Organizing Mechanism V.Narasimha Raghavan, M.Venkatesh, Divya Sridharabalan, T.Sabhanayagam, Nithin Bharath Abstract In our paper, we are utilizing
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 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 informationGateway Placement for Latency and Energy Efficient Data Aggregation
Gateway Placement for Latency and Energy Efficient Data Aggregation Jennifer L. Wong, Roozbeh Jafari, Miodrag Potkonjak University of California, Los Angeles Computer Science Department {jwong,rjafari,midorag}@cs.ucla.edu
More informationA Multipath AODV Reliable Data Transmission Routing Algorithm Based on LQI
Sensors & Transducers 2014 by IFSA Publishing, S. L. http://www.sensorsportal.com A Multipath AODV Reliable Data Transmission Routing Algorithm Based on LQI 1 Yongxian SONG, 2 Rongbiao ZHANG and Fuhuan
More informationA Power-Preserving Broadcast Protocol for WSNs With DoS Resistance
In Proceedings of 17th International IEEE Conference on Computer Communications and Networks, August 28, pp. 1-6 A Power-Preserving Broadcast Protocol for WSNs With DoS Resistance Chien-Chun Ni, Tien-Ruey
More informationCooperative Data Dissemination to Mission Sites
Cooperative Data Dissemination to Mission Sites Fangfei Chen a, Matthew P. Johnson b, Amotz Bar-Noy b and Thomas F. La Porta a a Department of Computer Science and Engineering, the Pennsylvania State University
More informationOn the Maximum Throughput of A Single Chain Wireless Multi-Hop Path
On the Maximum Throughput of A Single Chain Wireless Multi-Hop Path Guoqiang Mao, Lixiang Xiong, and Xiaoyuan Ta School of Electrical and Information Engineering The University of Sydney NSW 2006, Australia
More informationCONSTRUCTION AND EVALUATION OF MESHES BASED ON SHORTEST PATH TREE VS. STEINER TREE FOR MULTICAST ROUTING IN MOBILE AD HOC NETWORKS
CONSTRUCTION AND EVALUATION OF MESHES BASED ON SHORTEST PATH TREE VS. STEINER TREE FOR MULTICAST ROUTING IN MOBILE AD HOC NETWORKS 1 JAMES SIMS, 2 NATARAJAN MEGHANATHAN 1 Undergrad Student, Department
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 informationEstimate the Routing Protocols for Internet of Things
Estimate the Routing Protocols for Internet of Things 1 Manjushree G, 2 Jayanthi M.G 1,2 Dept. of Computer Network and Engineering Cambridge Institute of Technology Bangalore, India Abstract Internet of
More informationMotivation and Basics Flat networks Hierarchy by dominating sets Hierarchy by clustering Adaptive node activity. Topology Control
Topology Control Andreas Wolf (0325330) 17.01.2007 1 Motivation and Basics 2 Flat networks 3 Hierarchy by dominating sets 4 Hierarchy by clustering 5 Adaptive node activity Options for topology control
More informationDYNAMIC SEARCH TECHNIQUE USED FOR IMPROVING PASSIVE SOURCE ROUTING PROTOCOL IN MANET
DYNAMIC SEARCH TECHNIQUE USED FOR IMPROVING PASSIVE SOURCE ROUTING PROTOCOL IN MANET S. J. Sultanuddin 1 and Mohammed Ali Hussain 2 1 Department of Computer Science Engineering, Sathyabama University,
More informationA Gateway Selections Using Signal Strength among Clusters in Ad Hoc Networks
A Gateway Selections Using Signal Strength among Clusters in Ad Hoc Networks Mary Wu 1, ChongGun Kim 1 1*, HeeJoo park 1 Dept. of Computer Eng., Yeungnam Univ., Korea Dept. of Cyber Security., Kyungil
More informationOn the Complexity of Broadcast Scheduling. Problem
On the Complexity of Broadcast Scheduling Problem Sergiy Butenko, Clayton Commander and Panos Pardalos Abstract In this paper, a broadcast scheduling problem (BSP) in a time division multiple access (TDMA)
More information1 Better Approximation of the Traveling Salesman
Stanford University CS261: Optimization Handout 4 Luca Trevisan January 13, 2011 Lecture 4 In which we describe a 1.5-approximate algorithm for the Metric TSP, we introduce the Set Cover problem, observe
More informationMinimum Power Configuration for Wireless Communication in Sensor Networks
Minimum Power Configuration for Wireless Communication in Sensor Networks GUOLIANG XING City University of Hong Kong CHENYANG LU Washington University YING ZHANG and QINGFENG HUANG Palo Alto Research Center
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 informationWSNs have been deployed in a variety of dataintensive
IEEE TRANSACTIONS ON MOBILE COMPUTING 1 Mobile Relay Configuration in Data-intensive Wireless Sensor Networks Fatme El-Moukaddem, Eric Torng, Guoliang Xing Abstract Wireless Sensor Networks (WSNs) are
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 informationAn improved energy Minimum Connected Dominating Sets Construction Algorithm in MANET Zifen YANG 1, a, Guoqiang LI 1, b Li LIU 1, c
International Conference on Advances in Mechanical Engineering and Industrial Informatics (AMEII 2015) An improved energy Minimum Connected Dominating Sets Construction Algorithm in MANET Zifen YANG 1,
More informationMobile Ad-hoc Networks
Mobile Ad-hoc Networks Fred Baker 1 The manet problem Mobile Random and perhaps constantly changing Ad-hoc Not engineered Networks Elastic data applications which use networks to communicate 2 Examples
More informationNear Optimal Broadcast with Network Coding in Large Sensor Networks
in Large Sensor Networks Cédric Adjih, Song Yean Cho, Philippe Jacquet INRIA/École Polytechnique - Hipercom Team 1 st Intl. Workshop on Information Theory for Sensor Networks (WITS 07) - Santa Fe - USA
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 informationA Survey on Path Weight Based routing Over Wireless Mesh Networks
A Survey on Path Weight Based routing Over Wireless Mesh Networks Ankush Sharma Assistant Professor, Dept. Of C.S.E, Chandigarh University Gharuan, India Anuj Gupta Head C.S.E and M.C.A Dept, RIMT Mandi
More informationDual Power Management for Network Connectivity in Wireless Sensor Networks
Dual Power Management for Network Connectivity in Wireless Sensor Networks Yanxia Rong, Hongsik Choi and Hyeong-Ah Choi Department of Computer Science George Washington University Washington DC Department
More informationMulticast Scheduling in WDM Switching Networks
Multicast Scheduling in WDM Switching Networks Zhenghao Zhang and Yuanyuan Yang Dept. of Electrical & Computer Engineering, State University of New York, Stony Brook, NY 11794, USA Abstract Optical WDM
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 informationA local area network that employs either a full mesh topology or partial mesh topology
and Ad Hoc Networks Definition A local area network that employs either a full mesh topology or partial mesh topology Full mesh topology each node is connected directly to each of the others Partial mesh
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 informationPERFORMANCE ANALYSIS OF AODV ROUTING PROTOCOL IN MANETS
PERFORMANCE ANALYSIS OF AODV ROUTING PROTOCOL IN MANETS AMANDEEP University College of Engineering, Punjabi University Patiala, Punjab, India amandeep8848@gmail.com GURMEET KAUR University College of Engineering,
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 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 informationOn the Robustness of Distributed Computing Networks
1 On the Robustness of Distributed Computing Networks Jianan Zhang, Hyang-Won Lee, and Eytan Modiano Lab for Information and Decision Systems, Massachusetts Institute of Technology, USA Dept. of Software,
More informationarxiv: v2 [cs.ds] 25 Jan 2017
d-hop Dominating Set for Directed Graph with in-degree Bounded by One arxiv:1404.6890v2 [cs.ds] 25 Jan 2017 Joydeep Banerjee, Arun Das, and Arunabha Sen School of Computing, Informatics and Decision System
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 information6367(Print), ISSN (Online) Volume 4, Issue 2, March April (2013), IAEME & TECHNOLOGY (IJCET)
INTERNATIONAL International Journal of Computer JOURNAL Engineering OF COMPUTER and Technology ENGINEERING (IJCET), ISSN 0976- & TECHNOLOGY (IJCET) ISSN 0976 6367(Print) ISSN 0976 6375(Online) Volume 4,
More informationMinimum Power Configuration in 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-004-83 004-1-0 Minimum Power
More informationInvestigation on OLSR Routing Protocol Efficiency
Investigation on OLSR Routing Protocol Efficiency JIRI HOSEK 1, KAROL MOLNAR 2 Department of Telecommunications Faculty of Electrical Engineering and Communication, Brno University of Technology Purkynova
More informationVolume 2, Issue 4, April 2014 International Journal of Advance Research in Computer Science and Management Studies
Volume 2, Issue 4, April 2014 International Journal of Advance Research in Computer Science and Management Studies Research Article / Paper / Case Study Available online at: www.ijarcsms.com Efficient
More informationOn the Robustness of Distributed Computing Networks
1 On the Robustness of Distributed Computing Networks Jianan Zhang, Hyang-Won Lee, and Eytan Modiano Lab for Information and Decision Systems, Massachusetts Institute of Technology, USA Dept. of Software,
More informationThe Full Survey on The Euclidean Steiner Tree Problem
The Full Survey on The Euclidean Steiner Tree Problem Shikun Liu Abstract The Steiner Tree Problem is a famous and long-studied problem in combinatorial optimization. However, the best heuristics algorithm
More informationMultiHop Routing for Delay Minimization in WSN
MultiHop Routing for Delay Minimization in WSN Sandeep Chaurasia, Saima Khan, Sudesh Gupta Abstract Wireless sensor network, consists of sensor nodes in capacity of hundred or thousand, which deployed
More informationExpected Path Bandwidth Based Efficient Routing Mechanism in Wireless Mesh Network
Expected Path Bandwidth Based Efficient Routing Mechanism in Wireless Mesh Network K Anandkumar, D.Vijendra Babu PG Student, Chennai, India Head, Chennai, India ABSTRACT : Wireless mesh networks (WMNs)
More informationWIRELESS Multimedia Sensor Networks (WMSNs) is a
INTL JOURNAL OF ELECTRONICS AND TELECOMMUNICATIONS, 2017, VOL. 63, NO. 3, PP. 279-283 Manuscript received October 9, 2016; revised July, 2017. DOI: 10.1515/eletel-2017-0037 Energy-Efficient Routing Based
More informationReliable Time Synchronization Protocol for Wireless Sensor Networks
Reliable Time Synchronization Protocol for Wireless Sensor Networks Soyoung Hwang and Yunju Baek Department of Computer Science and Engineering Pusan National University, Busan 69-735, South Korea {youngox,yunju}@pnu.edu
More informationIssues of Long-Hop and Short-Hop Routing in Mobile Ad Hoc Networks: A Comprehensive Study
Issues of Long-Hop and Short-Hop Routing in Mobile Ad Hoc Networks: A Comprehensive Study M. Tarique, A. Hossain, R. Islam and C. Akram Hossain Dept. of Electrical and Electronic Engineering, American
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 informationPresenting a multicast routing protocol for enhanced efficiency in mobile ad-hoc networks
Presenting a multicast routing protocol for enhanced efficiency in mobile ad-hoc networks Mehdi Jalili, Islamic Azad University, Shabestar Branch, Shabestar, Iran mehdijalili2000@gmail.com Mohammad Ali
More informationIntroduction to Graph Theory
Introduction to Graph Theory Tandy Warnow January 20, 2017 Graphs Tandy Warnow Graphs A graph G = (V, E) is an object that contains a vertex set V and an edge set E. We also write V (G) to denote the vertex
More informationKapitel 5: Mobile Ad Hoc Networks. Characteristics. Applications of Ad Hoc Networks. Wireless Communication. Wireless communication networks types
Kapitel 5: Mobile Ad Hoc Networks Mobilkommunikation 2 WS 08/09 Wireless Communication Wireless communication networks types Infrastructure-based networks Infrastructureless networks Ad hoc networks Prof.
More informationIJREAT International Journal of Research in Engineering & Advanced Technology, Volume 1, Issue 2, April-May, 2013 ISSN:
Fast Data Collection with Reduced Interference and Increased Life Time in Wireless Sensor Networks Jayachandran.J 1 and Ramalakshmi.R 2 1 M.Tech Network Engineering, Kalasalingam University, Krishnan koil.
More informationDBSCAN APLLY In Weighted Clustering Algorithm
DBSCAN APLLY In Weighted Clustering Algorithm for MANET Manju Vishwakarma Research Scholar, Department of Computer Science and Engineering, Bhilai Institute of Technology, Durg, India. Partha Roy Associate
More informationAn Efficient Data-Centric Routing Approach for Wireless Sensor Networks using Edrina
An Efficient Data-Centric Routing Approach for Wireless Sensor Networks using Edrina Rajasekaran 1, Rashmi 2 1 Asst. Professor, Department of Electronics and Communication, St. Joseph College of Engineering,
More informationIP Multicast Technology Overview
IP multicast is a bandwidth-conserving technology that reduces traffic by delivering a single stream of information simultaneously to potentially thousands of businesses and homes. Applications that take
More informationSurveying Formal and Practical Approaches for Optimal Placement of Replicas on the Web
Surveying Formal and Practical Approaches for Optimal Placement of Replicas on the Web TR020701 April 2002 Erbil Yilmaz Department of Computer Science The Florida State University Tallahassee, FL 32306
More informationKey establishment in sensor networks
Security and Cooperation in Wireless Networks http://secowinet.epfl.ch/ key types; establishment of link keys using a shortterm master key; random key predistribution: - the basic scheme, and - some improvements;
More informationCALCULATION OF INFERENCE IN AD-HOC NETWORK
CALCULATION OF INFERENCE IN AD-HOC NETWORK POOJA GROVER, 2 NEHA GUPTA, 3 RANJIT KUMAR Asst. Prof., Department of Computer Science & Engineering, MDU, Rohtak, India-3300 2 Lecturer, Department of Information
More informationENERGY-AWARE FOR DH-AODV ROUTING PROTOCOL IN WIRELESS MESH NETWORK
ENERGY-AWARE FOR DH-AODV ROUTING PROTOCOL IN WIRELESS MESH NETWORK Yousif Ali Saadi, Rosilah Hassan and Dahlila Putri Dahnil Network Communication Lab Research, Centre for Software Technology and Management
More informationAd Hoc Networks: Issues and Routing
Ad Hoc Networks: Issues and Routing Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse574-08/
More informationFault-tolerant Power-aware Topology Control for Ad-hoc Wireless Networks
Fault-tolerant Power-aware Topology Control for Ad-hoc Wireless Networks Harichandan Roy, Shuvo Kumar De, Md.Maniruzzaman, and Ashikur Rahman Department of Computer Science and Engineering Bangladesh University
More informationJerrolyn Brees and Sukhamay Kundu Department of Computer Science Louisiana State University Baton Rouge, LA 70803, USA
Finding Shortest MultiPaths with O(N 2 ) Message Complexity Jerrolyn Brees and Sukhamay Kundu Department of Computer Science Louisiana State University Baton Rouge, LA 70803, USA Abstract This paper presents
More informationAMRIS: A Multicast Protocol for Ad hoc Wireless Networks
of AMRIS: A Multicast Protocol for Ad hoc Wireless Networks C.W. Wu, Y.C. Tay National University of Singapore wuchunwei@alum.comp.nus.edu.sg,tay@acm.org Abstract This paper introduces AMRIS, a new multicast
More informationViTAMin: A Virtual Backbone Tree Algorithm for Minimal Energy Consumption in Wireless Sensor Network Routing
ViTAMin: A Virtual Backbone Tree Algorithm for Minimal Energy Consumption in Wireless Sensor Network Routing Jaekwang Kim Department of Electrical and Computer Engineering, Sungkyunkwan University, Suwon,
More informationSurvey on Reliability Control Using CLR Method with Tour Planning Mechanism in WSN
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 4, Issue. 5, May 2015, pg.854
More informationA Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks
A Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks Jie Wu and Fei Dai Department of Computer Science and Engineering Florida Atlantic University Boca Raton, FL 33431 Email:fjie,fdaig@cse.fau.edu
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 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 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 informationON THE COMPLEXITY OF THE BROADCAST SCHEDULING PROBLEM
ON THE COMPLEXITY OF THE BROADCAST SCHEDULING PROBLEM SERGIY I. BUTENKO, CLAYTON W. COMMANDER, AND PANOS M. PARDALOS Abstract. In this paper, a Broadcast Scheduling Problem (bsp) in a time division multiple
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 informationProlonging Network Lifetime via Partially Controlled Node Deployment and Adaptive Data Propagation in WSN
Prolonging Network Lifetime via Partially Controlled Node Deployment and Adaptive Data Propagation in WSN Fangting Sun, Mark Shayman Department of Electrical and Computer Engineering University of Maryland,
More informationEfficient Broadcast Algorithms To Reduce number of transmission Based on Probability Scheme
Efficient Broadcast s To Reduce number of transmission Based on Probability Scheme S.Tharani, R.Santhosh Abstract Two main approaches to broadcast packets in wireless ad hoc networks are static and dynamic.
More informationMaximizing Network Topology Lifetime using Mobile Node Rotation
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1 Maximizing Network Topology Lifetime using Mobile Node Rotation Fatme El-Moukaddem, Eric Torng, Guoliang Xing Abstract One of the key challenges
More informationEfficient Broadcasting in Ad Hoc Wireless Networks Using Directional Antennas
Efficient Broadcasting in Ad Hoc Wireless Networks Using Directional Antennas Fei Dai Department of Electrical and Computer Engineering North Dakota State University Fargo, ND 5805 Email: fdai@ece.ndsu.edu
More informationDistributed minimum spanning tree problem
Distributed minimum spanning tree problem Juho-Kustaa Kangas 24th November 2012 Abstract Given a connected weighted undirected graph, the minimum spanning tree problem asks for a spanning subtree with
More informationData Caching under Number Constraint
1 Data Caching under Number Constraint Himanshu Gupta and Bin Tang Abstract Caching can significantly improve the efficiency of information access in networks by reducing the access latency and bandwidth
More informationCLUSTER BASED ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKS
CLUSTER BASED ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKS M.SASIKUMAR 1 Assistant Professor, Dept. of Applied Mathematics and Computational Sciences, PSG College of Technology, Coimbatore, Tamilnadu,
More informationGeographical Routing Algorithms In Asynchronous Wireless Sensor Network
Geographical Routing Algorithms In Asynchronous Wireless Sensor Network Vaishali.S.K, N.G.Palan Electronics and telecommunication, Cummins College of engineering for women Karvenagar, Pune, India Abstract-
More informationEnhanced Dead Line Aware Zone-Based Multilevel Packet Scheduling in Wireless Sensor Network
Enhanced Dead Line Aware Zone-Based Multilevel Packet Scheduling in Wireless Sensor Network Kujala Bhavani M.Tech, Gokaraju Rangaraju Institute of Engineering & Technology Dr.Padmalaya Nayak, Ph.D Professor,
More informationOn Minimizing Packet Loss Rate and Delay for Mesh-based P2P Streaming Services
On Minimizing Packet Loss Rate and Delay for Mesh-based P2P Streaming Services Zhiyong Liu, CATR Prof. Zhili Sun, UniS Dr. Dan He, UniS Denian Shi, CATR Agenda Introduction Background Problem Statement
More information