File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Minimizing average interference through topology control

TitleMinimizing average interference through topology control
Authors
KeywordsWireless sensor networks
Interference minimization
Topology control
Combinatorial optimization
Algorithmic problems
Issue Date2011
PublisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
Citation
The 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS 2011), Saarbrücken, Germany, 8-9 September 2011. In Lecture Notes in Computer Science, 2011, v. 7111, p. 115-129 How to Cite?
AbstractReducing interference is one of the main challenges in wireless communication. To minimize interference through topology control in wireless sensor networks is a well-known open algorithmic problem. In this paper, we answer the question of how to minimize the average interference when a node is receiving a message. We assume the receiver-centric interference model where the interference on a node is equal to the number of the other nodes whose transmission ranges cover the node. For one-dimensional (1D) networks, we propose a fast polynomial exact algorithm that can minimize the average interference. For two-dimensional (2D) networks, we give a proof that the maximum interference can be bounded while minimizing the average interference. The bound is only related to the distances between nodes but not the network size. Based on the bound, we propose the first exact algorithm to compute the minimum average interference in 2D networks. Optimal topologies with the minimum average interference can be constructed through traceback in both 1D and 2D networks. © 2012 Springer-Verlag.
DescriptionLNCS v. 7111 has title: Algorithms for sensor systems : 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2011, Saarbrücken, Germany, September 8-9, 2011 : revised selected papers
Persistent Identifierhttp://hdl.handle.net/10722/152033
ISBN
ISSN
2005 Impact Factor: 0.402
2015 SCImago Journal Rankings: 0.252
References

 

DC FieldValueLanguage
dc.contributor.authorLou, Ten_US
dc.contributor.authorTan, Hen_US
dc.contributor.authorWang, Yen_US
dc.contributor.authorLau, FCMen_US
dc.date.accessioned2012-06-26T06:32:41Z-
dc.date.available2012-06-26T06:32:41Z-
dc.date.issued2011en_US
dc.identifier.citationThe 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS 2011), Saarbrücken, Germany, 8-9 September 2011. In Lecture Notes in Computer Science, 2011, v. 7111, p. 115-129en_US
dc.identifier.isbn978-3-642-28208-9-
dc.identifier.issn0302-9743en_US
dc.identifier.urihttp://hdl.handle.net/10722/152033-
dc.descriptionLNCS v. 7111 has title: Algorithms for sensor systems : 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2011, Saarbrücken, Germany, September 8-9, 2011 : revised selected papers-
dc.description.abstractReducing interference is one of the main challenges in wireless communication. To minimize interference through topology control in wireless sensor networks is a well-known open algorithmic problem. In this paper, we answer the question of how to minimize the average interference when a node is receiving a message. We assume the receiver-centric interference model where the interference on a node is equal to the number of the other nodes whose transmission ranges cover the node. For one-dimensional (1D) networks, we propose a fast polynomial exact algorithm that can minimize the average interference. For two-dimensional (2D) networks, we give a proof that the maximum interference can be bounded while minimizing the average interference. The bound is only related to the distances between nodes but not the network size. Based on the bound, we propose the first exact algorithm to compute the minimum average interference in 2D networks. Optimal topologies with the minimum average interference can be constructed through traceback in both 1D and 2D networks. © 2012 Springer-Verlag.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.subjectWireless sensor networksen_US
dc.subjectInterference minimizationen_US
dc.subjectTopology controlen_US
dc.subjectCombinatorial optimizationen_US
dc.subjectAlgorithmic problems-
dc.titleMinimizing average interference through topology controlen_US
dc.typeConference_Paperen_US
dc.identifier.emailTan, H: hstan@hkusua.hku.hken_US
dc.identifier.emailLau, FCM: fcmlau@cs.hku.hk-
dc.identifier.authorityLau, FCM=rp00221en_US
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/978-3-642-28209-6_10en_US
dc.identifier.scopuseid_2-s2.0-84863164987-
dc.identifier.hkuros211547-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-84857251020&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume7111en_US
dc.identifier.spage115en_US
dc.identifier.epage129en_US
dc.publisher.placeGermanyen_US
dc.description.otherThe 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS 2011), Saarbrücken, Germany, 8-9 September 2011. In Lecture Notes in Computer Science, 2011, v. 7111, p. 115-129-
dc.identifier.scopusauthoridLau, FCM=7102749723en_US
dc.identifier.scopusauthoridWang, Y=55010728200en_US
dc.identifier.scopusauthoridTan, H=22936378500en_US
dc.identifier.scopusauthoridLou, T=25960811600en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats