A Distributed Joint Channel-Assignment, Scheduling and Routing Algorithm for Multi-Channel Ad Hoc Wireless Networks

In: Computers and Technology

Submitted By vkthik
Words 8961
Pages 36
A Distributed Joint Channel-Assignment,
Scheduling and Routing Algorithm for
Multi-Channel Ad Hoc Wireless Networks
Xiaojun Lin and Shahzada Rasool
School of Electrical and Computer Engineering, Purdue University
West Lafayette, IN 47907, U.S.A.
{linx,srasool}@ecn.purdue.edu

Abstract— The capacity of ad hoc wireless networks can be substantially increased by equipping each network node with multiple radio interfaces that can operate on multiple non-overlapping channels. However, new scheduling, channelassignment, and routing algorithms are required to fully utilize the increased bandwidth in multi-channel multi-radio ad hoc networks. In this paper, we develop a fully distributed algorithm that jointly solves the channel-assignment, scheduling and routing problem. Our algorithm is an online algorithm, i.e., it does not require prior information on the offered load to the network, and can adapt automatically to the changes in the network topology and offered load. We show that our algorithm is provably efficient. That is, even compared with the optimal centralized and offline algorithm, our proposed distributed algorithm can achieve a provable fraction of the maximum system capacity.
Further, the achievable fraction that we can guarantee is larger than that of some other comparable algorithms in the literature.

I. I NTRODUCTION
Multi-channel multi-radio ad hoc wireless networks have recently received a substantial amount of interest, especially under the context of wireless mesh networks [1]–[13]. It has been shown that one can significantly increase the capacity of ad hoc wireless networks by equipping each network node with multiple radio interfaces that operate on multiple non-overlapping channels. This is motivated by some current wireless LAN standards (in particular, IEEE 802.11) where the entire frequency band is divided into…...

Similar Documents

Routing Approaches of Delay Tolerant Networks

...Volume 1 – No. 17 Routing Approaches in Delay Tolerant Networks: A Survey R. J. D'Souza National Institute of Technology Karnataka, Surathkal, India Johny Jose National Institute of Technology Karnataka, Surathkal, India ABSTRACT Delay Tolerant Networks (DTNs) have evolved from Mobile Ad Hoc Networks (MANET). It is a network, where contemporaneous connectivity among all nodes doesn’t exist. This leads to the problem of how to route a packet from one node to another, in such a network. This problem becomes more complex, when the node mobility also is considered. The researchers have attempted to address this issue for over a decade. They have found that communication is possible in such a challenged network. The design of routing protocol for such networks is an important issue. This work surveys the literature and classifies the various routing approaches. discontinuity in the network. There are also methods that have employed additional mobile nodes, to provide better message delivery. Researchers are even exploring how the social interaction of humans can be utilized for routing in a DTN. This survey has made an extensive study of the various routing strategies taken by the researchers in the past few years. We have classified them based on the type of knowledge used for routing. 2. FLOODING BASED APPROACHES Knowledge about the network helps in deciding the best next hop. It can happen that the network has absolutely no knowledge about the network. In such......

Words: 6818 - Pages: 28

Computer Networks

...in the United States of America 10 9 8 7 6 5 4 3 2 1 Pearson Education LTD. Pearson Education Australia PTY, Limited Pearson Education Singapore, Pte. Ltd. Pearson Education North Asia Ltd. Pearson Education Canada, Ltd. Pearson Educación de Mexico, S.A. de C.V. Pearson Education — Japan Pearson Education Malaysia, Pte. Ltd. Pearson Education, Upper Saddle River, New Jersey Dedication To Suzanne, Barbara, Marvin, and the memory of Bram and Sweetie π Other bestselling titles by Andrew S. Tanenbaum Distributed Systems: Principles and Paradigms This new book, co-authored with Maarten van Steen, covers both the principles and paradigms of modern distributed systems. In the first part, it covers the principles of communication, processes, naming, synchronization, consistency and replication, fault tolerance, and security in detail. Then in the second part, it goes into different paradigms used to build distributed systems, including object-based systems, distributed file systems, document-based systems, and coordination-based systems. Numerous examples are discussed at length. Modern Operating Systems, 2nd edition This comprehensive text covers the principles of modern operating systems in detail and illustrates them with numerous real-world examples. After an introductory chapter, the next five chapters deal with the basic concepts: processes and threads, deadlocks, memory management, input/output, and file systems. The next six chapters deal with more advanced......

Words: 292171 - Pages: 1169

Optimal Power Allocation in Multi-Relay Mimo Cooperative Networks: Theory and Algorithms

...Allocation in Multi-Relay MIMO Cooperative Networks: Theory and Algorithms Abstract Cooperative networking is known to have significant potential in increasing network capacity and transmission reliability. Although there have been extensive studies on applying cooperative networking in multi-hop ad hoc networks, most works are limited to the basic three-node relay scheme and single-antenna systems. These two limitations are interconnected and both are due to a limited theoretical understanding of the optimal power allocation structure in MIMO cooperative networks (MIMO-CN). In this paper, we study the structural properties of the optimal power allocation in MIMO-CN with per-node power constraints. More specifically, we show that the optimal power allocations at the source and each relay follow a matching structure in MIMO-CN. This result generalizes the power allocation result under the basic three-node setting to the multi-relay setting, for which the optimal power allocation structure has been heretofore unknown. We further quantify the performance gain due to cooperative relay and establish a connection between cooperative relay and pure relay. Finally, based on these structural insights, we reduce the MIMO-CN rate maximization problem to an equivalent scalar formulation. We then propose a global optimization method to solve this simplified and equivalent problem. Architecture Existing System In Existing System, the multi-hop ad hoc networks most......

Words: 1026 - Pages: 5

Cognitive Radio Network

...POWER ALLOCATION FOR THE NETWORK CODED COGNITIVE COOPERATIVE NETWORK by Major Awal Uddin Ahmed (ID: 1003) Major Md Shariful Islam(ID: 1004) Major K M Hasnut Zamil (ID: 1006) A Project Report submitted to the department of Electrical Electronic and Communication Engineering in partial fulfillment of the requirements for the degree of Bachelor of Engineering in Electrical Electronic and Communication Engineering Advisor: M. Shamim Kaiser Military Institute of Science and Technology Mirpur Cantonment, Dhaka December 2010 To Our Beloved Parents ii DECLARATION This thesis is a presentation of my original research work. Wherever contributions of others are involved, every effort is made to indicate this clearly, with due reference to the literature, and acknowledgement of collaborative research and discussions. The work was done under the guidance of Dr. M. Shamim Kaiser, at the Mililary Institute of Science and Technology (MIST), Mirpur Cantonment, Dhaka. (Major Awal Uddin Ahmed (ID: 1003)) (Major Md Shariful Islam(ID: 1004)) (Major K M Hasnut Zamil (ID: 1006)) iii CERTIFICATE This is to certify that the thesis entitled POWER ALLOCATION FOR THE NETWORK CODED COGNITIVE COOPERATIVE NETWORK and submitted by Major Awal Uddin Ahmed (ID: 1003), Major Md Shariful Islam(ID: 1004), Major K M Hasnut Zamil (ID: 1006) for the degree of Bachelor of Engineering in Electrical Electronics and Communication Engineering. They embody original work under my......

Words: 9257 - Pages: 38

Routing in Wireless Sensor Networks

...Routing in Wireless Sensor Networks: application on Fire Detection Abstract: this paper is about fire detection in building using a modified APTEEN routing protocol. Here we design a system called iFireControl which is a smart detection system for buildings, which is more water efficient than many current systems, while keeping its robustness. introduction A Wireless Sensor network (WSN) consists of spatially distributed autonomous sensors to monitor physical or environmental conditions, such as temperature, sound, vibration, pressure, motion or pollutants and to cooperatively pass their data through the network to a main location. The more modern networks are bi-directional, also enabling control of sensors activity. The development of wireless sensor networks was motivated by military applications such as battlefield surveillance; nowadays such networks are used in many industrial and consumer applications, such as industrial process monitoring and control, machine health monitoring, Agriculture, Area Monitoring, Smart Home Monitoring, Seismic Monitoring etc. Wireless Sensor Networks provide a bridge between the real physical and virtual worlds; allow the ability to observe the previously unobservable at a fine resolution over large spatio-temporal scales. The WSN is built of “nodes” from a few to several hundreds or even thousands, where each node is connected to one (or sometimes several) sensors. Each such sensor network node has typically several parts: a...

Words: 4845 - Pages: 20

Simulations in Wireless Sensor and Ad Hoc Networks: Matching and Advancing Models, Metrics, and Solutions

...TOPICS IN AD HOC AND SENSOR NETWORKS Simulations in Wireless Sensor and Ad Hoc Networks: Matching and Advancing Models, Metrics, and Solutions Ivan Stojmenovic, University of Birmingham and University of Ottawa ABSTRACT The objective of this article is to give advice for carrying out a proper and effective simulation activity for protocol design. It challenges some of the existing criticisms of simulation practices that emphasized validation aspects. This article advocates the use of simple models, matching assumptions and metrics in the problem statement and simulation to provide a basic “proof of concept,” and comparison with truly competing solutions, which is possible only after a thorough and critical literature review. Then the complexity of the models can be increased (one parameter at a time), revising the algorithms themselves by adapting them to new assumptions, metrics, and the corresponding simulation environment. Selected independent variables should explain performance under a wide range of scenarios. unclear which protocol will perform well under a wide range of scenarios. It is our view that each article should be judged on its overall contribution, including the assumptions used, theory developed, new algorithms introduced, protocol details, simulation results, and relevance to an ultimate goal of staying on a path toward creating applications. We begin with a literature review of existing criticism for simulation practices, and then discuss what......

Words: 4845 - Pages: 20

Performance Analyses of a Multi-Carrier Cdma Wireless Communication System with Channel Impairment

...PERFORMANCE ANALYSES OF A MULTI-CARRIER CDMA WIRELESS COMMUNICATION SYSTEM WITH CHANNEL IMPAIRMENT Jobayer Anam Rana ID : 06110024 Nishi Rahman ID:06110021 A Thesis under Supervision of Dr.Satya Prasad Majumder In Partial Fulfillment of the Requirements for the Degree of Bachelor of Science in Electronics and Communication Engineering Department of Electrical and Electronic Engineering (Electronics and Communication Engineering Program) April -2010 BRAC University, Dhaka, Bangladesh i ii DECLARATION We hereby declare that this thesis is based on the results found by ourselves. Materials of work found by other researcher are mentioned by reference. This thesis, neither in whole nor in part, has been previously submitted for any degree. __________ Signature of Supervisor _________ Signature of Author iii ACKNOWLEDGEMENTS By the grace of God we have completed our thesis. We would like to thank our supervisor Dr. Satya Prasad Majumder for giving us the opportunity to work under his supervision. He has always help us by giving suggestions, ideas, advice and support to solve all our problems and guided us to developed this thesis for last two semester. We also thankful to Apurba Saha, Supriyo Shafkat Ahmed, Nazmus Saquib and Rumana Rahman for their inspiration and kind cooperation. We have worked hard and gave our best. Hopefully, our work will appreciated by our supervisor and respected faculties. iv ABSTRACT Analysis of the...

Words: 5839 - Pages: 24

A Novel Channel Estimation Algorithm for 3gpp Lte Downlink System Using Joint Time-Frequency Two-Dimensional Iterative Wiener Filter

...A Novel Channel Estimation Algorithm for 3GPP LTE Downlink System Using Joint Time-Frequency Two-Dimensional Iterative Wiener Filter Jinfeng Hou, Jian Liu School of Communication and Information Engineering University of Electronic Science and Technology of China (UESTC) Chengdu 611731, China Email: houjinfeng@gmail.com, liuj@uestc.edu.cn Abstract—The channel estimation algorithms are employed in 3GPP Long Term Evolution (LTE) downlink system to assist the coherent demodulation of Orthogonal Frequency Division Multiplexing (OFDM) symbols. Based on the comparison of several exiting different channel estimation algorithms, we propose a joint time-frequency two-dimensional iterative Wiener filter (IWF) channel estimation algorithm for 3GPP LTE downlink system. In this scheme, we first apply the linear minimum mean square error (LMMSE) algorithm based on singular value decomposition (SVD) for IWF in frequency domain, and then the values after the first filtering in frequency domain are used to achieve the second IWF in time domain. Comparing to the conventional algorithms, the channel estimation algorithm proposed by this paper brings up lower bit error rate (BER) and adds little computational complexity. I. I NTRODUCTION In December 2004, the Third Generation Partnership Program (3GPP) members started a feasibility study on the enhancement of the Universal Terrestrial Radio Access (UTRA) in the aim of continuing the long time frame competitiveness of the 3G Universal Mobile......

Words: 2979 - Pages: 12

Implementation and Evaluation of Wireless Mesh Networks on Manet Routing Protocols

...Evaluation of Wireless Mesh Networks on MANET Routing Protocols Shashi Bhushan1,Anil Saroliya2 ,Vijander Singh3 Research Scholar, Computer Science, Amity University, Jaipur, India 1 Assistant Professor, Computer Science, Amity University, Jaipur, India 2 Senior Lecturer, Computer Science, Amity University, Jaipur, India 3 Abstract—Wireless Mesh Network (WMN) is a kind of network which is made up of Mesh router and Mesh clients where Mesh router having lesser mobility and form the heart of WMNs. In this paper, Wireless Mesh Network over MANET implemented using routing protocols such as AODV, DSR. In this work NS-2.34 simulator is used for simulations. Various measurements and calculations were figure out in this work like throughput, Average end-end delay, PDR, NRL and Routing packets in Random way point mobility model. WMN have features such as self configuration, self healing and low cost of equipment. This work specifically aims to study the performance of routing protocols in a wireless mesh network, where static mesh routers and mobile clients participate together to implement networks functionality such as routing and packet forwarding in different mobility scenarios Keywords- Ad hoc Network, Routing Protocols, Wireless Mesh Network, Performance, Throughput, PDR, NRL and Routing packets in Random way point mobility model, Simulation on Network simulator NS-2, AODV,DSR , Routing Overhead. I. INTRODUCTION A Mobile Ad-hoc network (MANET) is an autonomous system of......

Words: 4335 - Pages: 18

Optimal Power Allocation and Scheduling for Two-Cell Capacity Maximization

...Optimal Power Allocation and Scheduling for Two-Cell Capacity Maximization ∗ Dept. Anders Gjendemsjø∗, David Gesbert†, Geir E. Øien∗ , and Saad G. Kiani† of Electronics and Telecom., Norwegian Univ. of Science and Technology, 7491 Trondheim, Norway, Email: {gjendems, oien}@iet.ntnu.no † Mobile Communications Department, Institute Eur´ com, e 06560 Sophia-Antipolis, France, Email: {gesbert, kiani}@eurecom.fr maximize the network capacity for the case of individual link power constraints [8] and a sum power constraint [9]. In [10] it is assumed that each base station, when it transmits, transmits with maximum power Pmax . Which base stations that should be active at each time slot is decided according to a rate maximization objective. However, no proof of optimality is given for the on/off power allocation. In [11] transmit power allocation for a downlink two-user interference channel is studied under a sum transmit power constraint and the assumption of symmetric interference. The derived power allocation depends on the level of interference; when the inference is above a certain threshold the total power is allocated to the best user. For interference less than the threshold, the available power is divided among the two users according to a water-filling principle. However, due to the sum power constraint and symmetry of interference assumption these results are not readily applicable for two-cell power allocation, where it is more reasonable to assume individual power......

Words: 4991 - Pages: 20

Impact of Mac Layer on the Performance of Odmrp, Fisheye, Aodv and Dsr, Routing Protocols in Mobile Ad Hoc Networks

...and DSR, Routing Protocols in Mobile Ad hoc Networks A. Sravani, G. Srinu, and A.Venkataramana Abstract— Mobile Ad hoc Network is an emerging area. Its standards are defined by IETF. MANET is a self generated, self organized and self handled network consisting of collection of independent nodes. MANETs Presents several desirable properties like dynamic topology, Easy of deployment and robustness, which are qualify them as an attractive topic for the research community. Providing QoS routing is a major issue in MANETs. Media Access Control layer plays crucial role in Ad hoc networks. Several routing protocols have already been proposed for MANETs. This paper describes the impact of MAC layer protocols like 802.11 and CSMA on the various routing protocols like AODV, DSR, ODMRP and Fisheye. Numbers of simulation scenarios were carried out by using Glomosim-2.03. The QoS parameters used are Throughput, Delay and PDR. Simulation results found that AODV performs better in 802.11 and CSMA, DSR and ODMRP performs better in only under 802.11. Keywords— MANET, AODV, DSR, FSR, GloMoSim, ODMRP I. INTRODUCTION Wireless communication networks are basically two types as shown in Fig.1. One is infrastructure based and other one is infrastructure less. Infrastructure based is cellular communications whereas infrastructure less is ad hoc networks. Fig.1 Classification of wireless communication networks A. Cellular Networks A Cellular Network is a wireless network......

Words: 2917 - Pages: 12

Simulation and Research on Data Fusion Algorithm of the Wireless Sensor Network Based on Ns2

...2009 World Congress on Computer Science and Information Engineering Simulation and Research on Data Fusion Algorithm of the Wireless Sensor Network Based on NS2 Junguo Zhang, Wenbin Li, Xueliang Zhao, Xiaodong Bai, Chen Chen Beijing Forestry University, 35 Qinghua East Road, Haidian District,Beijing, 100083 P.R.China information which processed by the embedded system to the user terminals by means of random selforganization wireless communication network through multi-hop relay. Thus it authentically achieves the purpose of ‘monitor anywhere and anytime’. The basic function of sensor network is gathering and sending back the information of the monitoring areas which the relevant sensor nodes are set in. But the sensor network node resources are very limited, which mainly embodies in battery capacity, processing ability, storage capacity, communication bandwidth and so on. Because of the limited monitoring range and reliability of each sensor, we have to make the monitoring areas of the sensor nodes overlapped when they are placed in order to enhance the robustness and accuracy of the information gathered by the entire network. In this case, certain redundancy in the gathered data will be inevitable. On the way of sending monitoring data by multi-hop relay to the sink nodes (or base stations) which are responsible to gather the data. It is necessary to reduce the redundant information by fusion processing. Data fusion is generally defined as......

Words: 3532 - Pages: 15

Wireless Sensor Networks

...SECURE ROUTING IN WIRELESS SENSOR NETWORKS By [Name] The Name of the Class (Course) Professor (Tutor): The Name of the School (University): The City and State The Date: Abstract. Wireless sensor networks (WSANs) are a group of sensors and actors that are linked by a wireless medium for the purpose of performing distributed sensing and action on a given task. This involves the sensors collecting information about the surrounding physical environment and sending the information to the actors which take the decisions and perform some needed action basing on the information received from the sensors about the surrounding environment. These sensor networks are sometimes referred to as wireless sensor and actuator networks. They monitor physical or environmental conditions such as sound, pressure, temperature among others and send the collected data to the required location. Effective sensing and acting requires a distributed local coordination methods and mechanism among the sensors and the actors in addition to this, sensor data should be valid in order for right and timely actions to be performed. This paper describes secure routing in wireless sensor networks and outlines its threats on security. Keywords: Wireless sensor and actor networks; Actuators; Ad hoc networks; Sybil attack; Real-time communication; Sinkhole; Routing; MAC; adversary. Introduction With the recent rapid improvement on technology, many networking technologies have been created to make...

Words: 5106 - Pages: 21

Wireless Network for Rural

...A Low-Cost Efficient Wireless Architecture for Rural Network Connectivity 1 Introduction Many rural regions around the world, especially in developing regions, do not have good connectivity solutions which are economically viable. As a result, many of these regions remain disconnected from both the rest of the world and from progress in general. In this proposal, I will describe the design of WiFi-based Rural Extensions (WiRE), a new wireless network architecture that can provide connectivity to rural regions at extremely low costs. The WiRE architecture is tailored for the typical rural landscape in several developing regions, in which the population is spread across small but scattered rural regions (less than 1-2 sq kms) within 100-200 kms of the city. WiRE is designed to be a wireless distribution network that extends connectivity from the city to each village. The WiRE architecture has largely been inspired by my prior work on WiFi-based Long Distance (WiLD) Networks [42, 62, 35, 54, 64, 34], a low cost point-to-point network connectivity solution that provides very high bandwidth (typically 6− 10 Mbps) over very long-distances. While prior work on WiLD networks [48, 5, 42, 62, 35] has made significant progress in the design of highperformance MAC layer solutions, we still lack a vision of how to design a comprehensive, low-cost, rural connectivity architecture that can efficiently support a wide-range of applications. It is this goal that I wish to......

Words: 10544 - Pages: 43

Wireless Mesh Network

...WIRE LESS MESS NETWORK WITH HRPU ABSTRACT A Wireless mesh network is a mesh network created through the connection of wireless access points installed at each network user’s locale. Each user is also a provider, forwarding data at next node. The networking infrastructure is decentralized and simplified because each node need only transmit as far as the next node. Wireless mesh networking could allow people living in the remote areas and small businesses operating in rural neighborhoods to connect their networks together for affordable Internet connections. Here we discuss a hybrid routing algorithm for wireless mesh networks. In HRPU, the mesh portal periodically broadcasts a mesh update message, which allows all nodes to have a route towards the mesh portal stored semi permanently in their routing table. Whenever a node has data to be sent to backbone network, it sends the data without any route establishment delay using the route to the mesh portal. In HRPU the mesh portals and mesh points are intelligent which further improves the performance. INTRODUCTION The Beginning: Wireless Mesh Networking (WMN) was developed as a quick way to set-up wireless networks during military operations. Since then it has grown considerably in popularity based on its advantages in both metropolitan and rural applications. WMNs are being applied as Hot Zones, which cover a broad area, such as a downtown city district. By 2010, municipal Wi-Fi networks will cover over......

Words: 4177 - Pages: 17