Algorithms for sink mobility in wireless sensor networks to improve network lifetime

Simple item page
buir.advisorKƶrpeoğlu, Ä°brahim
dc.contributor.authorKoƧ, Metin
dc.date.accessioned2016-01-08T18:06:50Z
dc.date.available2016-01-08T18:06:50Z
dc.date.issued2008
dc.descriptionAnkara : The Department of Computer Engineering and the Institute of Engineering and Science of Bilkent University, 2008.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 2008.en_US
dc.descriptionIncludes bibliographical references leaves 60-65.en_US
dc.description.abstractA wireless sensor network (WSN) consists of hundreds or thousands of sensor nodes organized in an ad-hoc manner to achieve a predefined goal. Although WSNs have limitations in terms of memory and processor, the main constraint that makes WSNs different from traditional networks is the battery problem. Since sensor nodes are generally deployed to areas with harsh environmental conditions, replacing the exhausted batteries become practically impossible. This requires to use the energy very carefully in both node and network level. Different approaches are proposed in the literature for improving network lifetime, including data aggregation, energy efficient routing schemes and MAC protocols, etc. Main motivation for these approaches is to prolong the network lifetime without sacrificing service quality. Sink (data collection node) mobility is also one of the effective solutions in the literature for network lifetime improvement. In this thesis, we focus on the controlled sink mobility and present a set of algorithms for different parts of the problem, like sink sites determination, and movement decision parameters. Moreover, a load balanced topology construction algorithm is given as another component of network lifetime improvement. Experiment results are presented which compare the performance of different components of the mobility scheme with other approaches in the literature, and the whole sink mobility scheme with random movement and static sink cases. As a result, it is observed that our algorithms perform better than random movement and static cases for different scenarios.en_US
dc.description.provenanceMade available in DSpace on 2016-01-08T18:06:50Z (GMT). No. of bitstreams: 1 0003604.pdf: 832431 bytes, checksum: 24b4002d451eaeec19f0cba81d7f0b62 (MD5)en
dc.description.statementofresponsibilityKoƧ, Metinen_US
dc.format.extentx, 65 leaves, graphsen_US
dc.identifier.itemidBILKUTUPB109334
dc.identifier.urihttp://hdl.handle.net/11693/14743
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectWireless Sensor Networksen_US
dc.subjectNetwork Lifetimeen_US
dc.subjectSink Mobilityen_US
dc.subjectTopologyen_US
dc.subjectConstructionen_US
dc.subject.lccTK7872.D48 K63 2008en_US
dc.subject.lcshSensor networks.en_US
dc.subject.lcshWireless LANs.en_US
dc.titleAlgorithms for sink mobility in wireless sensor networks to improve network lifetimeen_US
dc.typeThesisen_US
thesis.degree.disciplineComputer Engineering
thesis.degree.grantorBilkent University
thesis.degree.levelMaster's
thesis.degree.nameMS (Master of Science)

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
0003604.pdf
Size:
812.92 KB
Format:
Adobe Portable Document Format
Download

Collections

Graduate School of Engineering and Science