Minimum energy cooperative path routing in wireless networks: An integer programming formulation

Li Fulu; Andrew Lippman; Wu Kui

doi:10.1109/vetecs.2006.1682764

Minimum energy cooperative path routing in wireless networks: An integer programming formulation

Li Fulu
, Andrew Lippman
, Wu Kui

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

7 Citations (Scopus)

Abstract

We study the problem of minimum energy cooperative path (MECP) routing in wireless networks. The joint problem of cooperative routing in wireless networks that combines route selection and the transmit diversity was recently presented in [4], Several heuristic algorithms were also proposed in [4] to approximate the minimum energy cooperative path, while it has not been possible to judge the quality of the solutions with respect to the optimal. In this paper, we present an integer programming formulation of the MECP problem towards an optimal solution for a network where the locations of the nodes are known a priori and fixed. © 2006 IEEE.

Original language	English
Title of host publication	2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring - Proceedings
Pages	1-6
Volume	1
DOIs	https://doi.org/10.1109/vetecs.2006.1682764
Publication status	Published - 2006
Externally published	Yes
Event	2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring - Melbourne, Australia Duration: 7 May 2006 → 10 Jul 2006

Publication series

Name	IEEE Vehicular Technology Conference
Volume	1
ISSN (Print)	1550-2252

Conference

Conference	2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring
Place	Australia
City	Melbourne
Period	7/05/06 → 10/07/06

Bibliographical note

Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

Access Output

10.1109/vetecs.2006.1682764

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{548fe8d8b847477c87fccd1dcf2094d0,

title = "Minimum energy cooperative path routing in wireless networks: An integer programming formulation",

abstract = "We study the problem of minimum energy cooperative path (MECP) routing in wireless networks. The joint problem of cooperative routing in wireless networks that combines route selection and the transmit diversity was recently presented in [4], Several heuristic algorithms were also proposed in [4] to approximate the minimum energy cooperative path, while it has not been possible to judge the quality of the solutions with respect to the optimal. In this paper, we present an integer programming formulation of the MECP problem towards an optimal solution for a network where the locations of the nodes are known a priori and fixed. {\textcopyright} 2006 IEEE.",

author = "Li Fulu and Andrew Lippman and Wu Kui",

note = "Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].; 2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring ; Conference date: 07-05-2006 Through 10-07-2006",

year = "2006",

doi = "10.1109/vetecs.2006.1682764",

language = "English",

isbn = "0780393929",

volume = "1",

series = "IEEE Vehicular Technology Conference",

pages = "1--6",

booktitle = "2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring - Proceedings",

}

Fulu, L, Lippman, A & Kui, W 2006, Minimum energy cooperative path routing in wireless networks: An integer programming formulation. in 2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring - Proceedings. vol. 1, 1682764, IEEE Vehicular Technology Conference, vol. 1, pp. 1-6, 2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring, Melbourne, Australia, 7/05/06. https://doi.org/10.1109/vetecs.2006.1682764

Minimum energy cooperative path routing in wireless networks: An integer programming formulation. / Fulu, Li; Lippman, Andrew; Kui, Wu.
2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring - Proceedings. Vol. 1 2006. p. 1-6 1682764 (IEEE Vehicular Technology Conference; Vol. 1).

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - Minimum energy cooperative path routing in wireless networks

T2 - 2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring

AU - Fulu, Li

AU - Lippman, Andrew

AU - Kui, Wu

N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

PY - 2006

Y1 - 2006

N2 - We study the problem of minimum energy cooperative path (MECP) routing in wireless networks. The joint problem of cooperative routing in wireless networks that combines route selection and the transmit diversity was recently presented in [4], Several heuristic algorithms were also proposed in [4] to approximate the minimum energy cooperative path, while it has not been possible to judge the quality of the solutions with respect to the optimal. In this paper, we present an integer programming formulation of the MECP problem towards an optimal solution for a network where the locations of the nodes are known a priori and fixed. © 2006 IEEE.

AB - We study the problem of minimum energy cooperative path (MECP) routing in wireless networks. The joint problem of cooperative routing in wireless networks that combines route selection and the transmit diversity was recently presented in [4], Several heuristic algorithms were also proposed in [4] to approximate the minimum energy cooperative path, while it has not been possible to judge the quality of the solutions with respect to the optimal. In this paper, we present an integer programming formulation of the MECP problem towards an optimal solution for a network where the locations of the nodes are known a priori and fixed. © 2006 IEEE.

UR - https://www.scopus.com/pages/publications/34047151756

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-34047151756&origin=recordpage

U2 - 10.1109/vetecs.2006.1682764

DO - 10.1109/vetecs.2006.1682764

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 0780393929

SN - 9780780393929

VL - 1

T3 - IEEE Vehicular Technology Conference

SP - 1

EP - 6

BT - 2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring - Proceedings

Y2 - 7 May 2006 through 10 July 2006

ER -

Minimum energy cooperative path routing in wireless networks: An integer programming formulation

Abstract

Publication series

Conference

Bibliographical note

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this