Date of Submission

2-18-2008

Date of Award

2-18-2009

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Doctoral Thesis

Degree Name

Doctor of Philosophy

Subject Name

Computer Science

Department

Advance Computing and Microelectronics Unit (ACMU-Kolkata)

Supervisor

Nandy, Subhas Chandra (ACMU-Kolkata; ISI)

Abstract (Summary of the Work)

Due to the extraordinary growth of demand in mobile communication facility, design of efficient systems for providing specialized services has become an important issue in wireless mobility research. Broadly speaking, there are two major models for wireless networking: single-hop and multi-hop. The single-hop model [110] is based on the cellular network, and it provides one-hop wireless connectivity between the host and the static nodes known as base stations. single-hop networks rely on a fixed backbone infrastructure that interconnects all the base stations by high speed wired links. On the other hand, the multi-hop model requires neither fixed wired infrastructure nor predetermined interconnectivity [83]. Two main examples where the multi-hop model is adopted, are ad hoc network and sensor network [111].Ad hoc wireless networking is a technology that enables untethered wireless networking in the environments where no wired or cellular infrastructure is available, or if available, is not adequate or cost-effective. Indeed, in an ad hoc wireless network, the wireless links are established based on the ranges assigned to the radio stations. Ad hoc networking is the most popular type of multi-hop wireless network because of its simplicity (see Haas and Tabrizi [71]). This type of networking is useful in many practical applications, for example in a battlefield, for disaster management, etc. One of the main challenges in ad hoc wireless networks is the minimization of energy consumption. This can be achieved in several ways. The most important issues in this context are range assignment to the radio stations, and efficient routing of the packets as described below:Range assignment: Assigning range (a non-zero real number) to the radio stations in the network. This enables each radio station to transmit packets to the other radio stations within its range. Here, the goal is to assign ranges to the radio stations such that the desired communication among the radio stations can be established, and the total power consumption of the entire network is minimized.Routing: Transmission of packets from the source radio station to the destination radio station. Here, the power consumption of the network can be minimized by the choice of an appropriate path from source radio station to destination radiostation.On the other hand, a wireless sensor network (WSN) consists of large collection of co-operative small-scale nodes which can sense, perform limited computation, and can communicate over a short distance via wireless media. A WSN is self-organized in nature, and its members use short range broadcast communication to send the collected information to the base station in multi-hop fashion.In this thesis, we deal with the algorithmic aspects of the range assignment problem with a focus on the minimization of the total power requirement of the network maintaining its desired connectivity property. Two important sub-problems in this area are: • The radio stations are pre-placed, and the objective is to assign ranges to the radio stations such that the network maintains some specific connectivity property. This problem is referred to as the range assignment problem.

Comments

ProQuest Collection ID: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:28843763

Control Number

ISILib-TH321

Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.

DOI

http://dspace.isical.ac.in:8080/jspui/handle/10263/2146

Download

Included in

Mathematics Commons

Share

COinS