TY - GEN

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

AU - Qiu, Li

AU - Cao, Guohong

N1 - Funding Information:
This work was supported in part by the National Science Foundation (NSF) under grant CNS-1421578, and by Network Science CTA under grant W911NF-09-2-0053.

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

T2 - 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2017

Y2 - 10 July 2017

ER -