BROWSE

Graduate School of Ajou University Department of Computer Engineering 3. Theses(Master)

ON RELAY NODES PLACEMENT AND SELECTION STRATEGIES IN TWO-TIERED WIRELESS SENSOR NETWORKS

DC Field Value Language
dc.contributor.advisorKi-Hyung Kim-
dc.contributor.authorZafar, Bilal-
dc.date.accessioned2018-10-16T02:19:55Z-
dc.date.available2018-10-16T02:19:55Z-
dc.date.issued2010-08-
dc.identifier.other11030-
dc.identifier.urihttps://dspace.ajou.ac.kr/handle/2018.oak/2107-
dc.description학위논문(석사)--아주대학교 대학원 :컴퓨터공학과,2010. 8-
dc.description.tableofcontentsAcknowledgements . . . . . . . . . . . . . . . . . . . . . . . . . . . v List of Publications . . . . . . . . . . . . . . . . . . . . . . . . . . vii Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ix Table of Contents . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . x Chapter 1 Introduction . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . 1 1.1 Overview of Wireless Sensor Networks . . . . . . . . . . 1 1.2 Two-Tiered Wireless Sensor Networks . . . . . . . . . . 2 1.3 The Problems and Motivation . . . . . . . . . . . . . . . . 2 1.3.1 Problem I . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.3.2 Problem II . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.4 Contributions . . . . . . . . . . . . . . . . . . . .. . . . . . . . 4 I Proposed Relay Nodes Placement Algorithm 5 2 Problem Formulation . . . . . . . . . . . . . . . . . . . . . . . 6 2.1 Definitions and Terminology . . . . . . . . . . . . . . . . . 6 2.2 Problem Statement . . . . . . . . . . . . . . . . . .. . . . . . 7 3 Literature Review . . . . . . . . . . . . . . . . . . . . . . . . . . 8 4 The Proposed Improved Relay Nodes Placement Algorithm ................................................................11 5 Performance Analysis . . . . . . . . . . . . . ,,. . . . . . . . 18 5.1 Complexity Analysis . . . . . . . . . . . . . . . .. . . . . . 18 5.2 Worst Case Approximation Ratio . . . . . . .. . . . . . . 19 5.2.1 Lemma 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20 5.2.2 Theorem 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 5.3 Performance Analysis Through Simulations . . . . . 24 5.3.1 Simulation Environment . . . . . . . . . . .. . . . . . . . 24 5.3.2 Simulation Results . . . . . . . . . . . . . . . . . . . . . . 25 II Use of Relay Nodes Selection for Energy E_x000E_cient Broadcast in Cooperative TT-WSN .............................28 6 Motivation . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . 29 6.1 Why Broadcast? . . . . . . . . . . . . . . . . . . . . . . . . . 29 6.2 Overview of Proposed Scheme . . . . . . . . . . .. . . . 30 7 Background and Related Work . . . . . . . . . . . .. . . . . 31 7.1 Cooperative Communication . . . . . . . . . . . . . . . . 31 7.2 Related Work . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 8 Energy E_x000E_cient Forwarding Node Selection Algorithm .34 8.1 Network Model and Assumptions . . . . . . . . . . . . . 34 8.2 The Proposed Algorithm Details . . . . . . . . . . . . . . 35 9 Performance Analysis . . . . . . . . . . . . . . . . . . . . . . 39 10 Conclusion and Future Work . . . . . . . . . . . . . . . . . 43 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44 Curriculum Vitae . . . . .. . . . . . . . . . . . . . . . . . . . . . . 48-
dc.language.isoeng-
dc.publisherThe Graduate School, Ajou University-
dc.rights아주대학교 논문은 저작권에 의해 보호받습니다.-
dc.titleON RELAY NODES PLACEMENT AND SELECTION STRATEGIES IN TWO-TIERED WIRELESS SENSOR NETWORKS-
dc.typeThesis-
dc.contributor.affiliation아주대학교 산업대학원-
dc.contributor.department산업대학원 컴퓨터공학과-
dc.date.awarded2010. 8-
dc.description.degreeMaster-
dc.identifier.localId568900-
dc.identifier.urlhttp://dcoll.ajou.ac.kr:9080/dcollection/jsp/common/DcLoOrgPer.jsp?sItemId=000000011030-
dc.description.alternativeAbstractTwo-Tiered Wireless Sensor Network (TT-WSN) is a kind of heterogeneous network typically proposed to improve the lifetime longevity of the network. In TT-WSN the lower tier consists of sensor nodes (SN), which are mainly responsible for sensing the environment and forwarding the data to its one hop neighbor relay node (RN). While the upper tier is constituent of more power affluent relay nodes (RNs), which deliver the data to the base station through potentially multiple connected relay nodes in a multi-hop fashion. As relay nodes are more expensive, it is therefore desirable to deploy a minimum number of such nodes so that every sensor node has at least one relay node as its one-hop neighbor and all the relay nodes form a connected network. Unfortunately the problem of finding such a minimum set of relay nodes is NP-Hard. Thus, an approximation based algorithm is required to solve the problem in polynomial time with good approximation ratio. This study presents a fast and efficient approximation algorithm to solve the problem in polynomial time with a polynomial time worst-case time complexity of O(N^3), where N is the number of sensor nodes in the deployment region. The proposed algorithm is proved here to be a 3-approximation algorithm and the performance of the algorithm is compared with the existing algorithms through simulations. The extensive simulation results show that our algorithm outperforms the existing algorithms in terms of number of relay nodes deployed. Moreover, this study also proposes an energy efficient broadcast scheme for Two-Tiered Wireless Sensor Network (TT-WSN) that exploits cooperative communication. Cooperative communication allows nodes in the network to cooperate with each other and form a virtual MIMO system by sharing their antennas. Cooperative communication can provide significant energy savings for the broadcast process in (TT-WSN). The proposed scheme selects a smaller subset of relay nodes for forwarding broadcast messages by exploiting coop- erative communication. Extensive simulation study reveals significant reduction in energy consumption is achieved by reducing the redundant transmissions of the same message.-
Appears in Collections:
Graduate School of Ajou University > Department of Computer Engineering > 3. Theses(Master)
Files in This Item:
There are no files associated with this item.
Show simple item record

qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

  • License
    sherpa_romeo
    sherpa_juliet
STATISTICS
Total Visit :3,296,025
Total Download :1,737
Today View :3,842

AJOU

AJOU Central Library Repository는 국립중앙도서관 OAK 보급사업으로 구축되었습니다.

Browse

OAK Portal LOGIN