File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Minimizing interference for the highway model in wireless ad-hoc and sensor networks

TitleMinimizing interference for the highway model in wireless ad-hoc and sensor networks
Authors
KeywordsCombinatorial optimization
Dynamic programming
Interference minimization
Topology control
Wireless ad-hoc
Sensor networks
Issue Date2011
PublisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
Citation
The 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011), Novy Smokovec, Slovakia, 22-28 January 2011. In Lecture Notes in Computer Science, 2011, v. 6543, p. 520-532 How to Cite?
Abstract
Finding a low-interference connected topology is one of the fundamental problems in wireless ad-hoc and sensor networks. The receiver-centric interference on a node is the number of other nodes whose transmission ranges cover the node. The problem of reducing interference through adjusting the nodes' transmission ranges in a connected network can be formulated as that of connecting the nodes by a spanning tree while minimizing interference. In this paper, we study minimization of the average interference and the maximum interference for the high-way model, where all the nodes are arbitrarily distributed on a line. Two exact algorithms are proposed. One constructs the optimal topology that minimizes the average interference among all the nodes in polynomial time, O(n 3 Δ 3), where n is the number of nodes and Δ is the maximum node degree. The other algorithm constructs the optimal topology that minimizes the maximum interference in sub-exponential time, O(n 3Δ O(k)), where is the minimum maximum interference. © 2011 Springer-Verlag Berlin Heidelberg.
DescriptionLNCS v. 6543 entitled: SOFSEM 2011: theory and practice of computer science : 37th Conference on Current Trends in Theory and Practice of Computer Science ... 2011 : proceedings
Persistent Identifierhttp://hdl.handle.net/10722/151989
ISBN
ISSN
2013 SCImago Journal Rankings: 0.310
References

 

Author Affiliations
  1. The University of Hong Kong
  2. Tsinghua University
DC FieldValueLanguage
dc.contributor.authorTan, Hen_US
dc.contributor.authorLou, Ten_US
dc.contributor.authorLau, FCMen_US
dc.contributor.authorWang, Yen_US
dc.contributor.authorChen, Sen_US
dc.date.accessioned2012-06-26T06:32:11Z-
dc.date.available2012-06-26T06:32:11Z-
dc.date.issued2011en_US
dc.identifier.citationThe 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011), Novy Smokovec, Slovakia, 22-28 January 2011. In Lecture Notes in Computer Science, 2011, v. 6543, p. 520-532en_US
dc.identifier.isbn978-364218380-5-
dc.identifier.issn0302-9743en_US
dc.identifier.urihttp://hdl.handle.net/10722/151989-
dc.descriptionLNCS v. 6543 entitled: SOFSEM 2011: theory and practice of computer science : 37th Conference on Current Trends in Theory and Practice of Computer Science ... 2011 : proceedings-
dc.description.abstractFinding a low-interference connected topology is one of the fundamental problems in wireless ad-hoc and sensor networks. The receiver-centric interference on a node is the number of other nodes whose transmission ranges cover the node. The problem of reducing interference through adjusting the nodes' transmission ranges in a connected network can be formulated as that of connecting the nodes by a spanning tree while minimizing interference. In this paper, we study minimization of the average interference and the maximum interference for the high-way model, where all the nodes are arbitrarily distributed on a line. Two exact algorithms are proposed. One constructs the optimal topology that minimizes the average interference among all the nodes in polynomial time, O(n 3 Δ 3), where n is the number of nodes and Δ is the maximum node degree. The other algorithm constructs the optimal topology that minimizes the maximum interference in sub-exponential time, O(n 3Δ O(k)), where is the minimum maximum interference. © 2011 Springer-Verlag Berlin Heidelberg.en_US
dc.languageengen_US
dc.publisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/en_US
dc.relation.ispartofLecture Notes in Computer Scienceen_US
dc.rightsThe original publication is available at www.springerlink.com-
dc.subjectCombinatorial optimizationen_US
dc.subjectDynamic programmingen_US
dc.subjectInterference minimizationen_US
dc.subjectTopology controlen_US
dc.subjectWireless ad-hocen_US
dc.subjectSensor networks-
dc.titleMinimizing interference for the highway model in wireless ad-hoc and sensor networksen_US
dc.typeConference_Paperen_US
dc.identifier.emailLau, FCM: fcmlau@cs.hku.hken_US
dc.identifier.authorityLau, FCM=rp00221en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1007/978-3-642-18381-2_43en_US
dc.identifier.scopuseid_2-s2.0-78751673592en_US
dc.identifier.hkuros211556-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-78751673592&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume6543en_US
dc.identifier.spage520en_US
dc.identifier.epage532en_US
dc.publisher.placeGermanyen_US
dc.identifier.scopusauthoridChen, S=35361606300en_US
dc.identifier.scopusauthoridWang, Y=35222735000en_US
dc.identifier.scopusauthoridLau, FCM=7102749723en_US
dc.identifier.scopusauthoridLou, T=25960811600en_US
dc.identifier.scopusauthoridTan, H=22936378500en_US
dc.customcontrol.immutablesml 131205-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats