Maintaining social links through ampiify-and-forward in wireless networks

Li Qiu, Guohong Cao

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

It is critical to maintain the communication links between important social pairs. However, maintaining the social links between faraway nodes in wireless networks is extremely difficult. Although multi-hop transmission can be used, if two nodes in the routing path are out of the wireless transmission range, a network partition is possible. To address this problem, we adopt a cooperative amplify-and-forward strategy, where nodes (relays) cooperate to improve the signal strength at the destination. We formulate and study two optimization problems for maintaining the required link throughput: Min-Energy and Min-Relay, where the goal of Min-Energy is to minimize the power consumption of the relays, and the goal of Min-Relay is to minimize the number of active relays. Since the Min-Energy problem is a non-convex problem, we solve it based on an approximation technique and prove that our solution is a feasible, in fact optimal solution. We formulate the Min-Relay problem as an integer programming problem, and propose a polynomialtime algorithm which can select the minimum number of relays to maintain the social link. Evaluation results show that Min-Relay can significantly reduce the number of active relays compared to Min-Energy, while achieving comparable power consumption.

Original languageEnglish (US)
Title of host publicationMobiHoc 2017 - Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing
PublisherAssociation for Computing Machinery
ISBN (Electronic)9781450349123
DOIs
StatePublished - Jul 10 2017
Event18th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2017 - Chennai, India
Duration: Jul 10 2017 → …

Publication series

NameProceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)
VolumePart F129153

Other

Other18th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2017
CountryIndia
CityChennai
Period7/10/17 → …

Fingerprint

Wireless networks
Electric power utilization
Integer programming
Telecommunication links
Throughput

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Computer Networks and Communications
  • Software

Cite this

Qiu, L., & Cao, G. (2017). Maintaining social links through ampiify-and-forward in wireless networks. In MobiHoc 2017 - Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing [a23] (Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc); Vol. Part F129153). Association for Computing Machinery. https://doi.org/10.1145/3084041.3084055
Qiu, Li ; Cao, Guohong. / Maintaining social links through ampiify-and-forward in wireless networks. MobiHoc 2017 - Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing. Association for Computing Machinery, 2017. (Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)).
@inproceedings{33ce70587305449f88a5d4eb576513b7,
title = "Maintaining social links through ampiify-and-forward in wireless networks",
abstract = "It is critical to maintain the communication links between important social pairs. However, maintaining the social links between faraway nodes in wireless networks is extremely difficult. Although multi-hop transmission can be used, if two nodes in the routing path are out of the wireless transmission range, a network partition is possible. To address this problem, we adopt a cooperative amplify-and-forward strategy, where nodes (relays) cooperate to improve the signal strength at the destination. We formulate and study two optimization problems for maintaining the required link throughput: Min-Energy and Min-Relay, where the goal of Min-Energy is to minimize the power consumption of the relays, and the goal of Min-Relay is to minimize the number of active relays. Since the Min-Energy problem is a non-convex problem, we solve it based on an approximation technique and prove that our solution is a feasible, in fact optimal solution. We formulate the Min-Relay problem as an integer programming problem, and propose a polynomialtime algorithm which can select the minimum number of relays to maintain the social link. Evaluation results show that Min-Relay can significantly reduce the number of active relays compared to Min-Energy, while achieving comparable power consumption.",
author = "Li Qiu and Guohong Cao",
year = "2017",
month = "7",
day = "10",
doi = "10.1145/3084041.3084055",
language = "English (US)",
series = "Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)",
publisher = "Association for Computing Machinery",
booktitle = "MobiHoc 2017 - Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing",

}

Qiu, L & Cao, G 2017, Maintaining social links through ampiify-and-forward in wireless networks. in MobiHoc 2017 - Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing., a23, Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), vol. Part F129153, Association for Computing Machinery, 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2017, Chennai, India, 7/10/17. https://doi.org/10.1145/3084041.3084055

Maintaining social links through ampiify-and-forward in wireless networks. / Qiu, Li; Cao, Guohong.

MobiHoc 2017 - Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing. Association for Computing Machinery, 2017. a23 (Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc); Vol. Part F129153).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Maintaining social links through ampiify-and-forward in wireless networks

AU - Qiu, Li

AU - Cao, Guohong

PY - 2017/7/10

Y1 - 2017/7/10

N2 - It is critical to maintain the communication links between important social pairs. However, maintaining the social links between faraway nodes in wireless networks is extremely difficult. Although multi-hop transmission can be used, if two nodes in the routing path are out of the wireless transmission range, a network partition is possible. To address this problem, we adopt a cooperative amplify-and-forward strategy, where nodes (relays) cooperate to improve the signal strength at the destination. We formulate and study two optimization problems for maintaining the required link throughput: Min-Energy and Min-Relay, where the goal of Min-Energy is to minimize the power consumption of the relays, and the goal of Min-Relay is to minimize the number of active relays. Since the Min-Energy problem is a non-convex problem, we solve it based on an approximation technique and prove that our solution is a feasible, in fact optimal solution. We formulate the Min-Relay problem as an integer programming problem, and propose a polynomialtime algorithm which can select the minimum number of relays to maintain the social link. Evaluation results show that Min-Relay can significantly reduce the number of active relays compared to Min-Energy, while achieving comparable power consumption.

AB - It is critical to maintain the communication links between important social pairs. However, maintaining the social links between faraway nodes in wireless networks is extremely difficult. Although multi-hop transmission can be used, if two nodes in the routing path are out of the wireless transmission range, a network partition is possible. To address this problem, we adopt a cooperative amplify-and-forward strategy, where nodes (relays) cooperate to improve the signal strength at the destination. We formulate and study two optimization problems for maintaining the required link throughput: Min-Energy and Min-Relay, where the goal of Min-Energy is to minimize the power consumption of the relays, and the goal of Min-Relay is to minimize the number of active relays. Since the Min-Energy problem is a non-convex problem, we solve it based on an approximation technique and prove that our solution is a feasible, in fact optimal solution. We formulate the Min-Relay problem as an integer programming problem, and propose a polynomialtime algorithm which can select the minimum number of relays to maintain the social link. Evaluation results show that Min-Relay can significantly reduce the number of active relays compared to Min-Energy, while achieving comparable power consumption.

UR - http://www.scopus.com/inward/record.url?scp=85027460528&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85027460528&partnerID=8YFLogxK

U2 - 10.1145/3084041.3084055

DO - 10.1145/3084041.3084055

M3 - Conference contribution

AN - SCOPUS:85027460528

T3 - Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

BT - MobiHoc 2017 - Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing

PB - Association for Computing Machinery

ER -

Qiu L, Cao G. Maintaining social links through ampiify-and-forward in wireless networks. In MobiHoc 2017 - Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing. Association for Computing Machinery. 2017. a23. (Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)). https://doi.org/10.1145/3084041.3084055