EPLA: Energy-balancing packets scheduling for airborne relaying networks

Li, K; Ni, W; Wang, X; Liu, RP; Kanhere, SS; Jha, S

EPLA: Energy-balancing packets scheduling for airborne relaying networks

Li, K Ni, W

Wang, X Liu, RP

Kanhere, SS Jha, S

Permalink

Publication Type:: Conference Proceeding
Citation:: IEEE International Conference on Communications, 2015, 2015-September pp. 6246 - 6251
Issue Date:: 2015-09-09

Closed Access

	Filename	Description	Size
	07249319.pdf	Published version	570.13 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Li, K	en_US
dc.contributor.author	Ni, W https://orcid.org/0000-0002-4933-594X	en_US
dc.contributor.author	Wang, X	en_US
dc.contributor.author	Liu, RP https://orcid.org/0000-0001-7001-6305	en_US
dc.contributor.author	Kanhere, SS	en_US
dc.contributor.author	Jha, S	en_US
dc.date.issued	2015-09-09	en_US
dc.identifier.citation	IEEE International Conference on Communications, 2015, 2015-September pp. 6246 - 6251	en_US
dc.identifier.isbn	9781467364324	en_US
dc.identifier.issn	1550-3607	en_US
dc.identifier.uri	http://hdl.handle.net/10453/119632
dc.description.abstract	© 2015 IEEE. Airborne relaying is of potential to extend wireless sensor networks (WSN) to human-unfriendly terrains. Challenges arise due to lossy airborne channels and limited battery of unmanned aerial vehicles (UAVs). We propose an energy-efficient relaying scheme to overcome the challenges. A swarm of UAVs are deployed to listen to remote sensors from distributed locations, improving packet reception over lossy channels. UAVs report their reception qualities to the base station where the optimal schedule with guaranteed success rates and balanced energy consumption can be generated. Such scheduling is an NP-hard binary integer programming. We develop a suboptimal solution by decoupling the processes of energy balancing and data rate adjustment. Simulations confirm that, in terms of network yield, our method is indistinguishable to the NP-hard optimal solution, 15% higher than greedy algorithms. Our method can reduce the complexity by orders of magnitude, and extend network lifetime by 33%.	en_US
dc.relation.ispartof	IEEE International Conference on Communications	en_US
dc.relation.isbasedon	10.1109/ICC.2015.7249319	en_US
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	EPLA: Energy-balancing packets scheduling for airborne relaying networks	en_US
dc.type	Conference Proceeding
utslib.citation.volume	2015-September	en_US
utslib.for	0805 Distributed Computing	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney/Strength - GBDTC - Global Big Data Technologies
utslib.copyright.status	closed_access	*
pubs.publication-status	Published	en_US
pubs.volume	2015-September	en_US

Abstract:

© 2015 IEEE. Airborne relaying is of potential to extend wireless sensor networks (WSN) to human-unfriendly terrains. Challenges arise due to lossy airborne channels and limited battery of unmanned aerial vehicles (UAVs). We propose an energy-efficient relaying scheme to overcome the challenges. A swarm of UAVs are deployed to listen to remote sensors from distributed locations, improving packet reception over lossy channels. UAVs report their reception qualities to the base station where the optimal schedule with guaranteed success rates and balanced energy consumption can be generated. Such scheduling is an NP-hard binary integer programming. We develop a suboptimal solution by decoupling the processes of energy balancing and data rate adjustment. Simulations confirm that, in terms of network yield, our method is indistinguishable to the NP-hard optimal solution, 15% higher than greedy algorithms. Our method can reduce the complexity by orders of magnitude, and extend network lifetime by 33%.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/119632