Optimal Multicast Routing in Ad Hoc Networks
|
|
- Preston Parsons
- 5 years ago
- Views:
Transcription
1 Mat Independent esearch Projects in Applied Mathematics Optimal Multicast outing in Ad Hoc Networks Juha Leino 47032J 1st December 2002
2 Contents 1 Introduction 2 2 Optimal Multicasting in Ad Hoc Networks Problem Description Linear Programming Formulation Cutting Plane Algorithm Separating Inequalities Computational esults 8 4 Further Work 10 5 Conclusions 12 eferences 13
3 1 Introduction 2 1 Introduction Ad hoc networks (AHNs) are wireless networks without fixed infrastructure or centralized administration. The network consists of terminals, which act as routers in the network. In other words, a terminal is not only responsible for sending and receiving its own data, but it also has to forward the traffic of the other terminals. In Figure 1, an AHN is illustrated. Transmission range Source eceiver Figure 1: A multicast transmission in an ad hoc network Major advantages of the AHNs are rapid deployment, robustness, flexibility and support for mobility, which are useful in a wide range of applications. Existing technologies containing ad hoc networking support include wireless local area networks (WLANs) and personal area networks (PANs), for example the [9] and bluetooth [15] standards. The AHNs are useful in areas, where natural disasters have destroyed existing infrastructure. The independence of infrastructure is also a great benefit in a battlefield environment. The IETF s MANET working group [13] is creating standards and protocols for ad hoc networks. The group has published several internet-drafts of suggested AHN routing protocols. Multicasting in AHNs, i.e. one terminal sends the same data to multiple receivers, is an active field of research. Many multicast heuristics
4 2 Optimal Multicasting in Ad Hoc Networks 3 and protocols have been developed. For an introduction and performance analysis of five ad hoc multicast protocols, see [12]. In fixed networks, the metric used to evaluate route alternatives is often the throughput or the delay of the transmission. In many AHNs, the terminals are powered by batteries, thus energy consumption is an important issue. If power consumption is considered in the routing, the energy reduction can be up to 40-70% [16]. The less energy is spent, the longer the network remains operable. In this paper, we study the energy-efficient multicast routing in ad hoc networks. Instead of finding a good route as in previous research, the aim is to find the optimal one. While the approximate solutions are usually accurate enough for practical applications, the optimal solution is useful when the accuracy of the approximations is estimated. The optimal multicast routing in fixed networks, the Steiner tree problem in graphs, have been studied extensively and effective algorithms have been developed [3, 10, 14]. The best methods use linear programming (LP) algorithms. In this paper, the methods used in Steiner tree problems are applied to the AHN multicasting problem. This paper is organized as follows. In section 2, the problem is formulated and the algorithm used is introduced. In section 3, numerical results are presented. Improvements to the algorithm and further work are discussed in section 4. Finally, conclusions appear in section 5. 2 Optimal Multicasting in Ad Hoc Networks 2.1 Problem Description In this section, the optimal multicasting problem is described. The ad hoc network is assumed static. It consists of N identical nodes. The exact locations of the nodes are known when the routing decision is made. The transmission power p is proportional to r α, where r is the transmission range. The distance-power gradient α depends on the communication medium and varies between 2 and 4 [17]. The power of the nodes is limited, thus there is a maximum range max. A random node is chosen as the source s and a selected number N T as receivers T. The other nodes function as routers. A node must receive the signal before it
5 2.2 Linear Programming Formulation 4 can retransmit it and every receiver has to get the signal. Only one connection is studied at a time, thus there are no limitations on the capacity of the network. The problem is to choose such a transmission power for each node that the total power is minimized while there is a connection to every receiver. 2.2 Linear Programming Formulation In order to solve the multicast routing problem, we formulate it as an optimization problem. While the problem is to choose the transmission powers, the link states x ij are used as decision variables. x ij = 1 if the link from node i to node j is used and x ij = 0 otherwise. The notation t i (j) refers to the node, which is the jth closest to the node i. For example, x iti (1) is the variable related to the link from node i to its closest neighbour. In wireless networks, when a node transmits a signal, it is received by all the nodes within the transmission range. If the link x iti (j) is used, all the links x iti (k), k < j are also used. In the optimization problem, this broadcast constraint can be formulated as x iti (j+1) x iti (j), i, j. The cost c iti (j) corresponding to the link x iti (j) is the addition of power, if the transmission range of the node i is increased from the previous power level to the level which reaches the node t i (j), i.e. c iti (j) = r α it i (j) rα it i (j 1). The connectivity requirement is formulated using subsets of the nodes. We call the links, whose head is in a subset and tail in the complement of the subset, the crossing links. If an arbitrary subset containing at least one receiver is selected and not containing the source, the signal must be transmitted into the subset, thus the sum of the crossing links must be at least one. We call this the connectivity constraint. The problem formulation is min i,j c ij x ij (1) x ij 1, for all W V, s W, W C T (2) i W,j W C x iti (j+1) x iti (j), i, j (3) 0 x ij 1 (4) x ij integer, (5)
6 2.3 Cutting Plane Algorithm 5 where V is the set containing all the nodes. The problem is linear, thus integer linear programming (ILP) algorithms can be used. For an introduction to linear programming, see e.g. [2]. In Steiner tree research, the branch-and-cut algorithm has been used to solve the optimization problem. However, only a fraction of Steiner tree problems needs branching. If branching is not needed, the branch-and-cut algorithm reduces to the cutting plane algorithm. The implementation of a branch-and-cut algorithm is technical and laborious, hence we use a modified cutting plane algorithm instead. 2.3 Cutting Plane Algorithm The cutting plane algorithm can be summarized in the following way: Create a relaxed LP problem Do Solve the LP problem Separate violated constraints and add them to the problem Add cutting planes While there are inequalities added The relaxed problem is created from the original problem by removing the integer constraints. Also, part of the equation constraints can be removed. The relaxed problem is solved with some LP algorithm, for example the simplex. If the solution satisfies all the original constraints, it is the optimum. Otherwise, violated equation constraints are added to the relaxed problem. If the integer constraints are violated, cutting planes are added, which make the current fractional solution infeasible while preserving all the feasible integer values. The LP problem is solved again and the procedure is repeated until a feasible solution is found. In this paper, all the constraints except the bounds of the variables are removed, i.e. both the inequality and the integer constraints are removed. The separation of the inequality constraints (2) and (3) is presented in section 2.4. In Steiner tree problems, an integer solution is usually found using only the connectivity constraints. However, in ad hoc networks the broadcast constraints will often induce solutions with fractional link states, which are hard to eliminate with linear equations.
7 2.3 Cutting Plane Algorithm 6 In Figure 2, there is an example network with a fractional solution. Node 1 is the source and node 3 the receiver. The relevant constraints are x 13 + x 23 1 (6) x 13 + x 12 1 (7) x 13 x 12. (8) The optimal real valued solution is x 12 = x 13 = x 23 = 1/2 with the total cost An integer solution can be obtained with a cutting plane. Equation x 12 1 makes the fractional solution infeasible while all the integer link state values satisfying the equation constraint remain feasible. If the problem is solved with the additional constraint, the solution is x 12 = x 23 = 1 and x 13 = 0 and the total cost is 2.8. In the equivalent fixed network problem, the cost c 13 = 3.0 and the constraint (8) is missing. The optimal integer solution is found without any cutting planes. The separation of the cutting planes is hard if the network is more complex, thus we modify the cutting plane algorithm to avoid this problem. 1 c 12 =2.5 c 13 =0.5 2 c 23 =0.3 3 Figure 2: Example of fractional link states The modified algorithm is Create a relaxed LP problem Do Solve the LP problem using simplex Separate violated constraints and add them to the problem While there are inequalities added
8 2.4 Separating Inequalities 7 If there are fractional link states values Declare the variables integers Do Solve the ILP problem using branch-and-bound Separate violated constraints and add them to the problem While there are inequalities added First, inequality constraints are added and fractional link states are ignored. When no more violated equation constraints are found, the variables are declared integers and the iteration is continued. An optimization problem with integer variables can not be solved with simplex, thus the branch-and-bound algorithm is used. While the branch-and-bound algorithm consumes more time than the simplex algorithm, it is used only when no more violated constraints are found using real valued variables. This will reduce the number of branch-and-bound iterations and the total computation time. 2.4 Separating Inequalities There are two kinds of inequality constraints in the problem, the connectivity constraints (2) and the broadcast constraints (3). The number of these equations is very high, thus only the constraints which are needed are added. The connectivity constraint is examined separately for each receiver. The maxflow min-cut theorem [5] states, that the maximum value of the flow from a source node s to a sink node t in a capacitated network equals the minimum capacity among all s-t cuts. The link states are interpreted as capacities, thus the maximum flow from the source to a terminal equals the minimum sum of the crossing link states. If the sum is less than one, there is no connection to the receiver and a new constraint is added, i.e. the sum of states of the crossing links is at least one. The preflow-push algorithm by Goldberg and Tarjan [6] is used to find the maximum flow. To make the constraints more efficient, an idea called creep-flow [10] is applied. If a tiny capacity (10 6 is used) is added to links with zero capacity, the minimum cut calculation also minimizes the number of the crossing links. While the time to find the minimum cut increases with the creep-flows, the number of cutting plane iterations reduces significantly, thus the total time to solve the problem decreases.
9 3 Computational esults 8 When a violated connectivity constraint is found, the corresponding broadcast constraints are added. The constraints are added to every node, from which a crossing link originates. 3 Computational esults In this section, we report the computational experiences with the algorithm described in section 2. The algorithm is implemented in C and all runs are performed on a Sun Ultra 4 server. The LP solver used is IBM Optimization Solutions and Library (OSL) [8]. It is an efficient solver with great flexibility and customisability. The branch-and-bound routine is used without any problem specific tuning. The nodes are placed in a [0, 1] [0, 1] square. Value 2 is used for α when the link costs are determined. The number of the nodes, the number of the receivers and the maximum range are variated in order to analyze the performance of the algorithm. First, the effect of the maximum transmission range is studied. Every network has a critical transmission range crit, which is the threshold range required for connectivity, i.e. a connection can be established between any nodes in the network. If the size of the network is fixed, crit (N) is a random variable with a certain distribution for each N. In [11], Koskinen has analyzed the statistical properties of these distributions. The 95% quantile of crit (N) is 95 (N) N (9) For example, 95 (50) 0.29, i.e. if max = 0.29, a random network with 50 nodes is connected with probability In Table 1, there are the computation times with different max. andom networks with 40 nodes and 5 receivers were generated. If all the receivers could not be connected when max = 95 (40), the network was omitted. Each network were solved with three different max values. Thirty problems were solved. Table 1: The effect of the maximum range on computation time max crit = crit = 0.97 Mean computation time (s)
10 3 Computational esults 9 The longer the maximum range is, the longer the solving takes. The number of the broadcast constraints increases rapidly, because there are more crossing links in each cut. Each node has more links, which also results in more broadcast constraints. If the maximum range is long, a simple method can be used to speed up the computation. First, a heuristic approach is used to find an upper bound to the total energy. All the links, whose cost is higher than the upper bound, can be removed from the problem. For example, when the results in Table 1 were generated, the mean total power with unlimited range was If the heuristic solution is 30 percent worse than the optimum, the max can be set to = The shorter maximum range leads to significantly shorter computation times. Methods, which reduce the size of the optimization problem, are called preprocessing and will be discussed in more detail in section 4. When the scalability of the algorithm is studied, the choice of the max is critical as the previous results illustrated. If the maximum range is long, the number of links is high in larger networks. On the other hand, with a short maximum range, the networks with few nodes are seldom connected. When the scalability of the algorithm is studied, the 95 (N) threshold is used as max. Fifty random networks with 5 receivers were generated with different number of nodes. The results are in Table 2. Table 2: The effect of the number of the nodes on computation time Nodes max Mean computation time (s) The computation times grow longer as the number of the nodes increases. The amount of the variables and constraints in the individual optimization problems increases, thus the solving takes longer. Example solutions with 30 and 70 nodes are in Figure 3. The higher number of the nodes results in shorter transmission ranges. On the other hand, more links are used to establish the connection. Finally, the number of the receivers is varied. There are forty nodes and the maximum range is 95 (40) Fifty random networks were generated and solved. The computation times are in Table 3. Table 3: The effect of the number of the receivers on computation time eceivers Mean computation time (s)
11 4 Further Work 10 S S (a) Network with 30 nodes (b) Network with 70 nodes Figure 3: Example solutions with 5 receivers. Node S is the source and nodes are the receivers The number of the receivers have a significant effect on the computation time. With 5 receivers, the time depends on the topology of the network. If the receivers are on different edges of the network, the computation lasts longer than if the receivers are concentrated in a part of the network. When there are more receivers, the multicast connection spreads out over the whole network, thus the problem is harder to solve. Figure 4 illustrates the solutions with 5 and 35 receivers. The solution times are 1.84 and 43.6 seconds. 4 Further Work While the presented algorithm does work, the performance is not very good. Only small networks with limited number of receivers can be solved in reasonable time. There are numerous ways to improve the performance. In large optimization problems with integer variables, preprocessing is an important issue. The objective of the preprocessing is to remove unnecessary information from the problem. In network optimization, logical implications can be used to remove vertices and edges, while at least one optimal solution of the original problem remains. While the preprocessing consumes time, the total time to find
12 4 Further Work 11 S S (a) Network with 5 terminals (b) Network with 35 terminals Figure 4: Example solutions with 40 nodes. Node S is the source and nodes are the receivers the optimum is usually reduced significantly. The best Steiner tree algorithms [10, 14] have very efficient preprocessing algorithms. Only part of these algorithms can be used in ad hoc networks. For example, the Degree-Test I introduced by Beasley [1] is applicable, but the Special- Distance-Test by Duin and Volgenant [4] is not. In order to solve large ad hoc multicast problems, the suitable algorithms used with Steiner trees need to be applied. Also, new algorithms utilizing the properties of ad hoc networks could be developed. In the modified cutting plane algorithm, the most time consuming part is the branch-and-bound stage, whose effectiveness could be improved with problem specific tuning. The selection of the branching variable has a great impact on the course of the solving. The network topology could be used to choose a good branching variable selection strategy. An other approach is to select a better algorithm instead of the modified cutting plane method. The branch-and-cut algorithm is used in Steiner tree problems with good results. The impact of the fractional variables is lower, thus the performance improvement would be significant. The major disadvantage is the technical implementation.
13 5 Conclusions 12 A more efficient preflow-push algorithm of Hao and Orlin [7] could be used to find the minimum cut. However, the algorithm is more complex and the time to find the minimum cuts is not critical, because most of the time is consumed in the branch-and-bound algorithm. 5 Conclusions In this paper, we have studied energy-efficient multicasting in wireless ad hoc networks. The network was assumed static and only one connection was examined at a time. The multicast problem was formulated as a linear integer programming problem and a modified cutting plane algorithm was used to solve it. The performance of the algorithm was studied with different kinds of networks. The optimal solutions can be used to evaluate the performance of approximate solutions, but the performance is too slow for practical applications. The ad hoc problem proved to be significantly harder to solve than the Steiner tree problem. The broadcast constraints cause fractional link state values, which are hard to eliminate. Several improvements to the algorithm were suggested. Most importantly, a more efficient method of dealing with the fractional link states is needed, e.g. the branch-and-cut algorithm.
14 EFEENCES 13 eferences [1] J. E. Beasley. An algorithm for the Steiner tree problem in graphs. Networks, 14: , [2] D. Bertsimas and J. N. Tsitsiklis. Introduction to Linear Optimization. Athena Scientific, [3] C. W. Duin. Steiner s Problem in Graphs. PhD thesis, Amsterdam University, [4] C. W. Duin and A. Volgenant. An edge elimination test for the Steiner problem in graphs. Operation esearch Letters, 8:79 83, [5] L.. Ford, Jr. and D.. Fulkerson. Maximal flow through a network. Canadian Journal of Mathematics, 8: , [6] A. V. Goldberg and. E. Tarjan. A new approach to the maximum-flow problem. Journal of the ACM, 35: , [7] J. Hao and J. B. Orlin. A faster algorithm for finding the minimum cut in a graph. In Proceedings of the third annual ACM-Siam Symposium on Discrete Algorithms, pages , [8] IBM. Optimization solutions and library, software/data/bi/osl/index.html. [cited 1st December 2002]. [9] IEEE. Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications. LAN MAN Standards Committee, [10] T. Koch and A. Martin. Solving Steiner tree problems in graphs to optimality. Technical eport SC-96-42, Konrad-Zuse-Zentrum für Informationstechnik Berlin, [11] H. Koskinen. Connectivity in ad hoc networks. Technical report, Networking Laboratory, Helsinki University of Technology, [12] S. Lee, W. Su, J. Hsu, M. Gerla, and. Bagrodia. A performance comparison study of ad hoc wireless multicast protocols. In Proceedings of the IEEE Infocom 2000, pages , [13] html. [cited 1st December 2002].
15 EFEENCES 14 [14] T. Polzin and S. Vahdati Daneshmand. Improved algorithms for the Steiner problem in graphs. Discrete Applied Mathematics, 112: , [15] Bluetooth SIG, Inc. [cited 1st December 2002]. [16] S. Singh, M. Woo, and C. S. aghavendra. Power-aware routing in mobile ad hoc networks. In Proceeding of MOBICOM 1998, pages , [17] J. E. Wieselthier, G. D. Nguyen, and A. Ephremides. Algorithms for energyefficient multicasting in static ad hoc wireless networks. Mobile Networks and Application, 6: , 2001.
Efficient Multihop Broadcast for Wideband Systems
Efficient Multihop Broadcast for Wideband Systems Ivana Maric WINLAB, Rutgers University ivanam@winlab.rutgers.edu Roy Yates WINLAB, Rutgers University ryates@winlab.rutgers.edu Abstract In this paper
More informationMobile Base Stations Placement and Energy Aware Routing in Wireless Sensor Networks
Mobile Base Stations Placement and Energy Aware Routing in Wireless Sensor Networks A. P. Azad and A. Chockalingam Department of ECE, Indian Institute of Science, Bangalore 5612, India Abstract Increasing
More informationChapter 12. Cross-Layer Optimization for Multi- Hop Cognitive Radio Networks
Chapter 12 Cross-Layer Optimization for Multi- Hop Cognitive Radio Networks 1 Outline CR network (CRN) properties Mathematical models at multiple layers Case study 2 Traditional Radio vs CR Traditional
More informationCooperative Broadcast for Maximum Network Lifetime. Ivana Maric and Roy Yates
Cooperative Broadcast for Maximum Network Lifetime Ivana Maric and Roy Yates Wireless Multihop Network Broadcast N nodes Source transmits at rate R Messages are to be delivered to all the nodes Nodes can
More informationCooperative Routing in Wireless Networks
Cooperative Routing in Wireless Networks Amir Ehsan Khandani Jinane Abounadi Eytan Modiano Lizhong Zheng Laboratory for Information and Decision Systems Massachusetts Institute of Technology 77 Massachusetts
More informationA GRASP HEURISTIC FOR THE COOPERATIVE COMMUNICATION PROBLEM IN AD HOC NETWORKS
A GRASP HEURISTIC FOR THE COOPERATIVE COMMUNICATION PROBLEM IN AD HOC NETWORKS C. COMMANDER, C.A.S. OLIVEIRA, P.M. PARDALOS, AND M.G.C. RESENDE ABSTRACT. Ad hoc networks are composed of a set of wireless
More informationAnalysis of Power Assignment in Radio Networks with Two Power Levels
Analysis of Power Assignment in Radio Networks with Two Power Levels Miguel Fiandor Gutierrez & Manuel Macías Córdoba Abstract. In this paper we analyze the Power Assignment in Radio Networks with Two
More informationA GRASP heuristic for the Cooperative Communication Problem in Ad Hoc Networks
MIC2005: The Sixth Metaheuristics International Conference??-1 A GRASP heuristic for the Cooperative Communication Problem in Ad Hoc Networks Clayton Commander Carlos A.S. Oliveira Panos M. Pardalos Mauricio
More informationPractical Routing and Channel Assignment Scheme for Mesh Networks with Directional Antennas
This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the ICC 28 proceedings. Practical Routing and Channel Assignment Scheme
More informationUtilization Based Duty Cycle Tuning MAC Protocol for Wireless Sensor Networks
Utilization Based Duty Cycle Tuning MAC Protocol for Wireless Sensor Networks Shih-Hsien Yang, Hung-Wei Tseng, Eric Hsiao-Kuang Wu, and Gen-Huey Chen Dept. of Computer Science and Information Engineering,
More informationThe Potential of Relaying in Cellular Networks
Konrad-Zuse-Zentrum für Informationstechnik Berlin Takustraße 7 D-14195 Berlin-Dahlem Germany HANS-FLORIAN GEERDES, HOLGER KARL 1 The Potential of Relaying in Cellular Networks 1 Technische Universität
More informationTransportation Timetabling
Outline DM87 SCHEDULING, TIMETABLING AND ROUTING 1. Sports Timetabling Lecture 16 Transportation Timetabling Marco Chiarandini 2. Transportation Timetabling Tanker Scheduling Air Transport Train Timetabling
More informationPerformance Comparison of AODV, DSDV and ZRP Routing Protocols
Performance Comparison of AODV, DSDV and ZRP Routing Protocols Ajay Singh 1, Anil yadav 2, Dr. mukesh Sharma 2 1 Research Scholar (M.Tech), Department of Computer Science, T.I.T&S, bhiwani 1 Faculty, Department
More informationGateways Placement in Backbone Wireless Mesh Networks
I. J. Communications, Network and System Sciences, 2009, 1, 1-89 Published Online February 2009 in SciRes (http://www.scirp.org/journal/ijcns/). Gateways Placement in Backbone Wireless Mesh Networks Abstract
More informationFrom Wireless Network Coding to Matroids. Rico Zenklusen
From Wireless Network Coding to Matroids Rico Zenklusen A sketch of my research areas/interests Computer Science Combinatorial Optimization Matroids & submodular funct. Rounding algorithms Applications
More informationCOOPERATIVE ROUTING IN WIRELESS NETWORKS
Chapter COOPERATIVE ROUTING IN WIRELESS NETWORKS Amir E. Khandani Laboratory for Information and Decision Systems Massachusetts Institute of Technology khandani@mit.edu Eytan Modiano Laboratory for Information
More informationA Location-Aware Routing Metric (ALARM) for Multi-Hop, Multi-Channel Wireless Mesh Networks
A Location-Aware Routing Metric (ALARM) for Multi-Hop, Multi-Channel Wireless Mesh Networks Eiman Alotaibi, Sumit Roy Dept. of Electrical Engineering U. Washington Box 352500 Seattle, WA 98195 eman76,roy@ee.washington.edu
More informationPartial overlapping channels are not damaging
Journal of Networking and Telecomunications (2018) Original Research Article Partial overlapping channels are not damaging Jing Fu,Dongsheng Chen,Jiafeng Gong Electronic Information Engineering College,
More informationA Practical Approach to Bitrate Control in Wireless Mesh Networks using Wireless Network Utility Maximization
A Practical Approach to Bitrate Control in Wireless Mesh Networks using Wireless Network Utility Maximization EE359 Course Project Mayank Jain Department of Electrical Engineering Stanford University Introduction
More informationOptimizing Client Association in 60 GHz Wireless Access Networks
Optimizing Client Association in 60 GHz Wireless Access Networks G Athanasiou, C Weeraddana, C Fischione, and L Tassiulas KTH Royal Institute of Technology, Stockholm, Sweden University of Thessaly, Volos,
More informationWireless Multicasting with Channel Uncertainty
Wireless Multicasting with Channel Uncertainty Jie Luo ECE Dept., Colorado State Univ. Fort Collins, Colorado 80523 e-mail: rockey@eng.colostate.edu Anthony Ephremides ECE Dept., Univ. of Maryland College
More informationPerformance Evaluation of MANET Using Quality of Service Metrics
Performance Evaluation of MANET Using Quality of Service Metrics C.Jinshong Hwang 1, Ashwani Kush 2, Ruchika,S.Tyagi 3 1 Department of Computer Science Texas State University, San Marcos Texas, USA 2,
More informationColumn Generation. A short Introduction. Martin Riedler. AC Retreat
Column Generation A short Introduction Martin Riedler AC Retreat Contents 1 Introduction 2 Motivation 3 Further Notes MR Column Generation June 29 July 1 2 / 13 Basic Idea We already heard about Cutting
More informationA Bi-Level Programming Model for the Wireless Network Jamming Placement Problem
Proceedings of the 2014 Industrial and Systems Engineering Research Conference Y. Guan and H. Liao, eds. A Bi-Level Programming Model for the Wireless Network Jamming Placement Problem Satish Vadlamani
More informationAd Hoc Networks 8 (2010) Contents lists available at ScienceDirect. Ad Hoc Networks. journal homepage:
Ad Hoc Networks 8 (2010) 545 563 Contents lists available at ScienceDirect Ad Hoc Networks journal homepage: www.elsevier.com/locate/adhoc Routing, scheduling and channel assignment in Wireless Mesh Networks:
More informationOptical Networks with Limited Wavelength Conversion.
Practical Routing and Wavelength Assignment algorithms for All Optical Networks with Limited Wavelength Conversion M.D. Swaminathan*, Indian Institute of Science, Bangalore, India. Abstract We present
More informationApproches basées sur les métaheuristiques pour la gestion de flotte en temps réel
Approches basées sur les métaheuristiques pour la gestion de flotte en temps réel Frédéric SEMET LAMIH, UMR CNRS, Université de Valenciennes Motivation Réseau terrestre (GSM) Telecommunication GPS laptop
More informationMaximizing Number of Satisfiable Routing Requests in Static Ad Hoc Networks
Maximizing Number of Satisfiable Routing Requests in Static Ad Hoc Networks Zane Sumpter 1, Lucas Burson 1, Bin Tang 2, Xiao Chen 3 1 Department of Electrical Engineering and Computer Science, Wichita
More informationA Mathematical Formulation for Joint Channel Assignment and Multicast Routing in Multi-Channel Multi-Radio Wireless Mesh Networks
A Mathematical Formulation for Joint Channel Assignment and Multicast Routing in Multi-Channel Multi-Radio Wireless Mesh Networks M. Jahanshahi 1 Department of Computer Engineering, Science and Research
More informationMaximum flow problem in wireless ad hoc networks with directional antennas
Optimization Letters (2007) 1:71 84 DOI 10.1007/s11590-006-0016-3 ORIGINAL PAPER Maximum flow problem in wireless ad hoc networks with directional antennas Xiaoxia Huang Jianfeng Wang Yuguang Fang Received:
More informationAvailable Bandwidth in Multirate and Multihop Wireless Sensor Networks
2009 29th IEEE International Conference on Distributed Computing Systems Available Bandwidth in Multirate and Multihop Wireless Sensor Networks Feng Chen, Hongqiang Zhai and Yuguang Fang Department of
More informationReliable Videos Broadcast with Network Coding and Coordinated Multiple Access Points
Reliable Videos Broadcast with Network Coding and Coordinated Multiple Access Points Pouya Ostovari and Jie Wu Computer & Information Sciences Temple University Center for Networked Computing http://www.cnc.temple.edu
More informationMulticast Energy Aware Routing in Wireless Networks
Ahmad Karimi Department of Mathematics, Behbahan Khatam Alanbia University of Technology, Behbahan, Iran karimi@bkatu.ac.ir ABSTRACT Multicasting is a service for disseminating data to a group of hosts
More informationBroadcast with Heterogeneous Node Capability
Broadcast with Heterogeneous Node Capability Intae Kang and Radha Poovendran Department of Electrical Engineering, University of Washington, Seattle, WA. email: {kangit,radha}@ee.washington.edu Abstract
More informationEnergy Saving Routing Strategies in IP Networks
Energy Saving Routing Strategies in IP Networks M. Polverini; M. Listanti DIET Department - University of Roma Sapienza, Via Eudossiana 8, 84 Roma, Italy 2 june 24 [scale=.8]figure/logo.eps M. Polverini
More informationENERGY EFFICIENT SENSOR NODE DESIGN IN WIRELESS SENSOR NETWORKS
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. 3, Issue. 4, April 2014,
More informationAlgorithms and Data Structures: Network Flows. 24th & 28th Oct, 2014
Algorithms and Data Structures: Network Flows 24th & 28th Oct, 2014 ADS: lects & 11 slide 1 24th & 28th Oct, 2014 Definition 1 A flow network consists of A directed graph G = (V, E). Flow Networks A capacity
More informationTransmission Scheduling in Capture-Based Wireless Networks
ransmission Scheduling in Capture-Based Wireless Networks Gam D. Nguyen and Sastry Kompella Information echnology Division, Naval Research Laboratory, Washington DC 375 Jeffrey E. Wieselthier Wieselthier
More informationOptimization Methods for UMTS Radio Network Planning,
Optimization Methods for UMTS Radio Network Planning, Andreas Eisenblätter 1, Armin Fügenschuh 2, Hans-Florian Geerdes 3, Daniel Junglas 2, Thorsten Koch 3, and Alexander Martin 2 1 Atesio GmbH, Berlin
More informationSensitivity Analysis of EADARP Multicast Protocol
www.ijcsi.org 273 Sensitivity Analysis of EADARP Multicast Protocol Dina Darwish Mutlimedia and Internet Department, International Academy for Engineering and Media Science 6 th October city, Egypt Abstract
More informationChannel Assignment Algorithms: A Comparison of Graph Based Heuristics
Channel Assignment Algorithms: A Comparison of Graph Based Heuristics ABSTRACT Husnain Mansoor Ali University Paris Sud 11 Centre Scientifique d Orsay 9145 Orsay - France husnain.ali@u-psud.fr This paper
More informationPerformance Limits of Fair-Access in Sensor Networks with Linear and Selected Grid Topologies John Gibson * Geoffrey G.
In proceedings of GLOBECOM Ad Hoc and Sensor Networking Symposium, Washington DC, November 7 Performance Limits of Fair-Access in Sensor Networks with Linear and Selected Grid Topologies John Gibson *
More informationVariable Bit Rate Transmission Schedule Generation in Green Vehicular Roadside Units
Variable Bit Rate Transmission Schedule Generation in Green Vehicular Roadside Units Abdulla A. Hammad 1, Terence D. Todd 1 and George Karakostas 2 1 Department of Electrical and Computer Engineering McMaster
More informationCHANNEL ASSIGNMENT IN AN IEEE WLAN BASED ON SIGNAL-TO- INTERFERENCE RATIO
CHANNEL ASSIGNMENT IN AN IEEE 802.11 WLAN BASED ON SIGNAL-TO- INTERFERENCE RATIO Mohamad Haidar #1, Rabindra Ghimire #1, Hussain Al-Rizzo #1, Robert Akl #2, Yupo Chan #1 #1 Department of Applied Science,
More informationOn the Unicast Capacity of Stationary Multi-channel Multi-radio Wireless Networks: Separability and Multi-channel Routing
1 On the Unicast Capacity of Stationary Multi-channel Multi-radio Wireless Networks: Separability and Multi-channel Routing Liangping Ma arxiv:0809.4325v2 [cs.it] 26 Dec 2009 Abstract The first result
More informationLocalization (Position Estimation) Problem in WSN
Localization (Position Estimation) Problem in WSN [1] Convex Position Estimation in Wireless Sensor Networks by L. Doherty, K.S.J. Pister, and L.E. Ghaoui [2] Semidefinite Programming for Ad Hoc Wireless
More informationOptimized Asynchronous Multi-channel Neighbor Discovery
Optimized Asynchronous Multi-channel Neighbor Discovery Niels Karowski TKN/TU-Berlin niels.karowski@tu-berlin.de Aline Carneiro Viana INRIA and TKN/TU-Berlin aline.viana@inria.fr Adam Wolisz TKN/TU-Berlin
More informationQuality-of-Service Provisioning for Multi-Service TDMA Mesh Networks
Quality-of-Service Provisioning for Multi-Service TDMA Mesh Networks Petar Djukic and Shahrokh Valaee 1 The Edward S. Rogers Sr. Department of Electrical and Computer Engineering University of Toronto
More informationA Column Generation Method for Spatial TDMA Scheduling in Ad Hoc Networks
A Column Generation Method for Spatial TDMA Scheduling in Ad Hoc Networks Patrik Björklund, Peter Värbrand, Di Yuan Department of Science and Technology, Linköping Institute of Technology, SE-601 74, Norrköping,
More informationSmart Deployment/Movement of Unmanned Air Vehicle to Improve Connectivity in MANET
Smart Deployment/Movement of Unmanned Air Vehicle to Improve Connectivity in MANET Zhu Han, A. Lee Swindlehurst, and K. J. Ray Liu Electrical and Computer Engineering Department, University of Maryland,
More informationA Comparative Study of Quality of Service Routing Schemes That Tolerate Imprecise State Information
A Comparative Study of Quality of Service Routing Schemes That Tolerate Imprecise State Information Xin Yuan Wei Zheng Department of Computer Science, Florida State University, Tallahassee, FL 330 {xyuan,zheng}@cs.fsu.edu
More informationPopulation Adaptation for Genetic Algorithm-based Cognitive Radios
Population Adaptation for Genetic Algorithm-based Cognitive Radios Timothy R. Newman, Rakesh Rajbanshi, Alexander M. Wyglinski, Joseph B. Evans, and Gary J. Minden Information Technology and Telecommunications
More informationLocation Problems in Wireless Sensor Network for Improving Its Reliability and Performance
Location Problems in Wireless Sensor Network for Improving Its Reliability and Performance DENIS MIGOV Institute of Computational Mathematics and Mathematical Geophysics of SB RAS Laboratory of Dynamical
More informationOn the Capacity of Multi-Hop Wireless Networks with Partial Network Knowledge
On the Capacity of Multi-Hop Wireless Networks with Partial Network Knowledge Alireza Vahid Cornell University Ithaca, NY, USA. av292@cornell.edu Vaneet Aggarwal Princeton University Princeton, NJ, USA.
More informationSimple, Optimal, Fast, and Robust Wireless Random Medium Access Control
Simple, Optimal, Fast, and Robust Wireless Random Medium Access Control Jianwei Huang Department of Information Engineering The Chinese University of Hong Kong KAIST-CUHK Workshop July 2009 J. Huang (CUHK)
More informationJoint Power-Delay Minimization in Green Wireless Access Networks
Joint Power-Delay Minimization in Green Wireless Access Networks Farah Moety, Samer Lahoud, Kinda Khawam, Bernard Cousin University of Rennes I - IRISA, France University of Versailles - PRISM, France
More informationInformation flow over wireless networks: a deterministic approach
Information flow over wireless networks: a deterministic approach alman Avestimehr In collaboration with uhas iggavi (EPFL) and avid Tse (UC Berkeley) Overview Point-to-point channel Information theory
More informationAdvanced Modeling and Simulation of Mobile Ad-Hoc Networks
Advanced Modeling and Simulation of Mobile Ad-Hoc Networks Prepared For: UMIACS/LTS Seminar March 3, 2004 Telcordia Contact: Stephanie Demers Robert A. Ziegler ziegler@research.telcordia.com 732.758.5494
More informationTIME- OPTIMAL CONVERGECAST IN SENSOR NETWORKS WITH MULTIPLE CHANNELS
TIME- OPTIMAL CONVERGECAST IN SENSOR NETWORKS WITH MULTIPLE CHANNELS A Thesis by Masaaki Takahashi Bachelor of Science, Wichita State University, 28 Submitted to the Department of Electrical Engineering
More informationS-GPBE: A Power-Efficient Broadcast Routing Algorithm Using Sectored Antenna
S-GPBE: A Power-Efficient Broadcast Routing Algorithm Using Sectored Antenna Intae Kang and Radha Poovendran Department of Electrical Engineering, University of Washington, Seattle, WA. - email: {kangit,radha}@ee.washington.edu
More informationA Comparison of Power-Efficient Broadcast Routing Algorithms
A Comparison of Power-Efficient Broadcast Routing Algorithms Intae Kang and Radha Poovendran Department of Electrical Engineering, University of Washington, Seattle, WA 98195-25 email: {kangit,radha}@ee.washington.edu
More informationAdaptive Sensor Selection Algorithms for Wireless Sensor Networks. Silvia Santini PhD defense October 12, 2009
Adaptive Sensor Selection Algorithms for Wireless Sensor Networks Silvia Santini PhD defense October 12, 2009 Wireless Sensor Networks (WSNs) WSN: compound of sensor nodes Sensor nodes Computation Wireless
More informationA Topology Control Approach to Using Directional Antennas in Wireless Mesh Networks
A Topology Control Approach to Using Directional Antennas in Wireless Mesh Networks Umesh Kumar, Himanshu Gupta and Samir R. Das Department of Computer Science State University of New York at Stony Brook
More informationRelay Placement in Sensor Networks
Relay Placement in Sensor Networks Jukka Suomela 14 October 2005 Contents: Wireless Sensor Networks? Relay Placement? Problem Classes Computational Complexity Approximation Algorithms HIIT BRU, Adaptive
More informationTraffic Grooming for WDM Rings with Dynamic Traffic
1 Traffic Grooming for WDM Rings with Dynamic Traffic Chenming Zhao J.Q. Hu Department of Manufacturing Engineering Boston University 15 St. Mary s Street Brookline, MA 02446 Abstract We study the problem
More informationPhase Transition Phenomena in Wireless Ad Hoc Networks
Phase Transition Phenomena in Wireless Ad Hoc Networks Bhaskar Krishnamachari y, Stephen B. Wicker y, and Rámon Béjar x yschool of Electrical and Computer Engineering xintelligent Information Systems Institute,
More informationDelay Aware Link Scheduling for Multi-hop TDMA Wireless Networks
1 Delay Aware Link Scheduling for Multi-hop TDMA Wireless Networks Petar Djukic and Shahrokh Valaee Abstract Time division multiple access (TDMA) based medium access control (MAC) protocols can provide
More informationDistributed Power Control in Cellular and Wireless Networks - A Comparative Study
Distributed Power Control in Cellular and Wireless Networks - A Comparative Study Vijay Raman, ECE, UIUC 1 Why power control? Interference in communication systems restrains system capacity In cellular
More informationDelay-Tolerant Data Gathering in Energy Harvesting Sensor Networks With a Mobile Sink
Globecom 2012 - Ad Hoc and Sensor Networking Symposium Delay-Tolerant Data Gathering in Energy Harvesting Sensor Networks With a Mobile Sink Xiaojiang Ren Weifa Liang Research School of Computer Science
More informationGateway Placement for Throughput Optimization in Wireless Mesh Networks
Gateway Placement for Throughput Optimization in Wireless Mesh Networks Fan Li Yu Wang Department of Computer Science University of North Carolina at Charlotte, USA Email: {fli, ywang32}@uncc.edu Xiang-Yang
More informationTRANSMISSION STRATEGIES FOR SINGLE-DESTINATION WIRELESS NETWORKS
The 20 Military Communications Conference - Track - Waveforms and Signal Processing TRANSMISSION STRATEGIES FOR SINGLE-DESTINATION WIRELESS NETWORKS Gam D. Nguyen, Jeffrey E. Wieselthier 2, Sastry Kompella,
More informationOn Optimum Communication Cost for Joint Compression and Dispersive Information Routing
2010 IEEE Information Theory Workshop - ITW 2010 Dublin On Optimum Communication Cost for Joint Compression and Dispersive Information Routing Kumar Viswanatha, Emrah Akyol and Kenneth Rose Department
More informationGrundlagen der Rechnernetze. Introduction
Grundlagen der Rechnernetze Introduction Overview Building blocks and terms Basics of communication Addressing Protocols and Layers Performance Historical development Grundlagen der Rechnernetze Introduction
More informationLocation Discovery in Sensor Network
Location Discovery in Sensor Network Pin Nie Telecommunications Software and Multimedia Laboratory Helsinki University of Technology niepin@cc.hut.fi Abstract One established trend in electronics is micromation.
More informationTraffic-Aware Relay Node Deployment for Data Collection in Wireless Sensor Networks
Traffic-Aware Relay Node Deployment for Data Collection in Wireless Sensor Networks Feng Wang School of Computing Science Simon Fraser University British Columbia, Canada Email: fwa@cs.sfu.ca Dan Wang
More informationW CDMA Network Design
Technical Report 03-EMIS-02 W CDMA Network Design Qibin Cai 1 Joakim Kalvenes 2 Jeffery Kennington 1 Eli Olinick 1 1 {qcai,jlk,olinick}@engr.smu.edu School of Engineering Southern Methodist University
More informationA Simple Greedy Algorithm for Link Scheduling with the Physical Interference Model
A Simple Greedy Algorithm for Link Scheduling with the Physical Interference Model Abstract In wireless networks, mutual interference prevents wireless devices from correctly receiving packages from others
More informationEnergy-efficient Broadcasting in All-wireless Networks
Energy-efficient Broadcasting in All-wireless Networks Mario Čagalj Jean-Pierre Hubaux Laboratory for Computer Communications and Applications (LCA) Swiss Federal Institute of Technology Lausanne (EPFL)
More informationWavelength Assignment Problem in Optical WDM Networks
Wavelength Assignment Problem in Optical WDM Networks A. Sangeetha,K.Anusudha 2,Shobhit Mathur 3 and Manoj Kumar Chaluvadi 4 asangeetha@vit.ac.in 2 Kanusudha@vit.ac.in 2 3 shobhitmathur24@gmail.com 3 4
More informationCHANNEL ASSIGNMENT AND LOAD DISTRIBUTION IN A POWER- MANAGED WLAN
CHANNEL ASSIGNMENT AND LOAD DISTRIBUTION IN A POWER- MANAGED WLAN Mohamad Haidar Robert Akl Hussain Al-Rizzo Yupo Chan University of Arkansas at University of Arkansas at University of Arkansas at University
More informationEnergy-aware Scheduling with Deadline and Reliability Constraints in Wireless Networks
Energy-aware Scheduling with Deadline and Reliability Constraints in Wireless Networks G. Sudha Anil Kumar, G. Manimaran and Z. Wang Real-ime Computing and Networking Laboratory Dept. of Electrical and
More informationMobility Tolerant Broadcast in Mobile Ad Hoc Networks
Mobility Tolerant Broadcast in Mobile Ad Hoc Networks Pradip K Srimani 1 and Bhabani P Sinha 2 1 Department of Computer Science, Clemson University, Clemson, SC 29634 0974 2 Electronics Unit, Indian Statistical
More informationPower Control Optimization of Code Division Multiple Access (CDMA) Systems Using the Knowledge of Battery Capacity Of the Mobile.
Power Control Optimization of Code Division Multiple Access (CDMA) Systems Using the Knowledge of Battery Capacity Of the Mobile. Rojalin Mishra * Department of Electronics & Communication Engg, OEC,Bhubaneswar,Odisha
More informationAd Hoc Networks - Routing and Security Issues
Ad Hoc Networks - Routing and Security Issues Mahalingam Ramkumar Mississippi State University, MS January 25, 2005 1 2 Some Basic Terms Basic Terms Ad Hoc vs Infrastructured AHN MANET (Mobile Ad hoc NETwork)
More informationStanford University CS261: Optimization Handout 9 Luca Trevisan February 1, 2011
Stanford University CS261: Optimization Handout 9 Luca Trevisan February 1, 2011 Lecture 9 In which we introduce the maximum flow problem. 1 Flows in Networks Today we start talking about the Maximum Flow
More informationInterference-Aware Joint Routing and TDMA Link Scheduling for Static Wireless Networks
Interference-Aware Joint Routing and TDMA Link Scheduling for Static Wireless Networks Yu Wang Weizhao Wang Xiang-Yang Li Wen-Zhan Song Abstract We study efficient interference-aware joint routing and
More informationChapter 4. Linear Programming. Chapter Outline. Chapter Summary
Chapter 4 Linear Programming Chapter Outline Introduction Section 4.1 Mixture Problems: Combining Resources to Maximize Profit Section 4.2 Finding the Optimal Production Policy Section 4.3 Why the Corner
More informationFrequency and Power Allocation for Low Complexity Energy Efficient OFDMA Systems with Proportional Rate Constraints
Frequency and Power Allocation for Low Complexity Energy Efficient OFDMA Systems with Proportional Rate Constraints Pranoti M. Maske PG Department M. B. E. Society s College of Engineering Ambajogai Ambajogai,
More informationSharing Multiple Messages over Mobile Networks! Yuxin Chen, Sanjay Shakkottai, Jeffrey G. Andrews
2011 Infocom, Shanghai!! April 12, 2011! Sharing Multiple Messages over Mobile Networks! Yuxin Chen, Sanjay Shakkottai, Jeffrey G. Andrews Information Spreading over MANET!!! users over a unit area Each
More informationEnergy-Efficient MANET Routing: Ideal vs. Realistic Performance
Energy-Efficient MANET Routing: Ideal vs. Realistic Performance Paper by: Thomas Knuz IEEE IWCMC Conference Aug. 2008 Presented by: Farzana Yasmeen For : CSE 6590 2013.11.12 Contents Introduction Review:
More informationWireless LAN Applications LAN Extension Cross building interconnection Nomadic access Ad hoc networks Single Cell Wireless LAN
Wireless LANs Mobility Flexibility Hard to wire areas Reduced cost of wireless systems Improved performance of wireless systems Wireless LAN Applications LAN Extension Cross building interconnection Nomadic
More informationolsr.org 'Optimized Link State Routing' and beyond December 28th, 2005 Elektra
olsr.org 'Optimized Link State Routing' and beyond December 28th, 2005 Elektra www.scii.nl/~elektra Introduction Olsr.org is aiming to an efficient opensource routing solution for wireless networks Work
More informationCONVERGECAST, namely the collection of data from
1 Fast Data Collection in Tree-Based Wireless Sensor Networks Özlem Durmaz Incel, Amitabha Ghosh, Bhaskar Krishnamachari, and Krishnakant Chintalapudi (USC CENG Technical Report No.: ) Abstract We investigate
More informationMinimum Cost Topology Construction for Survivable Wireless Mesh Networks in Rural Area
0 0th International Conference on Mobile Ad-hoc and Sensor Networks Minimum Cost Topology Construction for Survivable Wireless Mesh Networks in Rural Area Suk Jin Lee* Computer Science Texas A&M University
More informationWireless Networks Do Not Disturb My Circles
Wireless Networks Do Not Disturb My Circles Roger Wattenhofer ETH Zurich Distributed Computing www.disco.ethz.ch Wireless Networks Geometry Zwei Seelen wohnen, ach! in meiner Brust OSDI Multimedia SenSys
More informationA Computational Approach to the Joint Design of Distributed Data Compression and Data Dissemination in a Field-Gathering Wireless Sensor Network
A Computational Approach to the Joint Design of Distributed Data Compression and Data Dissemination in a Field-Gathering Wireless Sensor Network Enrique J. Duarte-Melo, Mingyan Liu Electrical Engineering
More informationSimultaneous optimization of channel and power allocation for wireless cities
Simultaneous optimization of channel and power allocation for wireless cities M. R. Tijmes BSc BT Mobility Research Centre Complexity Research Group Adastral Park Martlesham Heath, Suffolk IP5 3RE United
More informationA survey on broadcast protocols in multihop cognitive radio ad hoc network
A survey on broadcast protocols in multihop cognitive radio ad hoc network Sureshkumar A, Rajeswari M Abstract In the traditional ad hoc network, common channel is present to broadcast control channels
More informationWireless Network Coding with Local Network Views: Coded Layer Scheduling
Wireless Network Coding with Local Network Views: Coded Layer Scheduling Alireza Vahid, Vaneet Aggarwal, A. Salman Avestimehr, and Ashutosh Sabharwal arxiv:06.574v3 [cs.it] 4 Apr 07 Abstract One of the
More informationOptimisation and Operations Research
Optimisation and Operations Research Lecture : Graph Problems and Dijkstra s algorithm Matthew Roughan http://www.maths.adelaide.edu.au/matthew.roughan/ Lecture_notes/OORII/
More information