✦ LIBER ✦

Minimum energy cooperative path routing in all-wireless networks: NP-completeness and heuristic algorithms

✍ Scribed by Li, Fulu; Wu, Kui; Lippman, Andrew

Book ID: 120837628
Publisher: Institute of Electrical and Electronics Engineers
Year: 2008
Tongue: English
Weight: 833 KB
Volume: 10
Category: Article
ISSN: 1229-2370
DOI: 10.1109/JCN.2008.6389840

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum-energy broadcast and multicast i

Minimum-energy broadcast and multicast in wireless networks: An integer programming approach and improved heuristic algorithms

✍ Di Yuan; Joanna Bauer; Dag Haugland 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 835 KB

Both integer programming models and heuristic algorithms have been proposed for finding minimum-energy broadcast and multicast trees in wireless ad hoc networks. Among heuristic algorithms, the broadcast/multicast incremental power (BIP/MIP) algorithm is most known. The theoretical performance of BI

[IEEE IEEE INFOCOM 2012 - IEEE Conferenc

[IEEE IEEE INFOCOM 2012 - IEEE Conference on Computer Communications - Orlando, FL, USA (2012.03.25-2012.03.30)] 2012 Proceedings IEEE INFOCOM - On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approximation algorithms

✍ Kuo, Tung-Wei; Tsai, Ming-Jer 📂 Article 📅 2012 🏛 IEEE ⚖ 161 KB

[IEEE 2010 International Conference on W

[IEEE 2010 International Conference on Wireless Communication and Sensor Computing (ICWCSC) - Chennai, Tamil Nadu, India (2010.01.2-2010.01.4)] 2010 International Conference on Wireless Communication and Sensor Computing (ICWCSC) - Energy efficient dynamic shortest path routing in wireless Ad hoc sensor networks using genetic algorithm

✍ Nallusamy, R.; Duraiswamy, K.; Muthukumar, D. Ayya; Sathiyakumar, C. 📂 Article 📅 2010 🏛 IEEE ⚖ 222 KB