83
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

A framework for recursive algorithms in low-energy broadcast networks

ORCID Icon &
Pages 321-340 | Received 12 Dec 2017, Accepted 02 Mar 2018, Published online: 21 Mar 2018

References

  • Kik M . Merging and merge-sort in a single hop radio network. Theory Pract Comp Sci. 2006;36:341–349.
  • MacKenzie PD , Stout QF . Ultra-fast expected time parallel algorithms. J Algorithms. 1998;26:1–33.
  • Lin H , Uster H . Exact and heuristic algorithms for data-gathering cluster-based wireless sensor network design problem. IEEE Trans Netw. 2014;22(3):903–916.
  • Singh M , Prasanna VK . Energy-optimal and energy-balanced sorting in a single-hop wireless sensor network. Perv Comput Comm. 2003;1:50–59.
  • Hart JK , Martinez K . Environmental sensor networks. IEEE Comput. 2004;37(8):50–56.
  • Winkler M , Tuchs KD , Hughes K , et al . Theoretical and practical aspects of military wireless sensor networks. J Telecom Inf Tec. 2008;2:37–45.
  • Li Q , De Rosa M , Rus D . Distributed algorithms for guiding navigation across a sensor network. Mobi Comput Netw. 2003;9:313–325.
  • Otto C , Milenkovic A , Sanders C , et al . System architecture of a wireless body area sensor network for ubiquitous health monitoring. J Mobi Multi. 2006;1(4):307–326.
  • Jarry A , Leone P , Nikoletseas S , et al . Optimal data gathering paths and energy-balance mechanisms in wireless networks. Ad Hoc Netw. 2011;9(6):1036–1048.
  • Mottola L , Picco GP . Programming wireless sensor networks: fundamental concepts and state of the art. ACM Comput Surv. 2011;43(3):Article ID. 19.
  • Atzori L , Iera A , Morabito G . The internet of things: a survey. Comput Netw. 2010;54(18):2787–2805.
  • Ren S , He Y , Xu F . Provably-efficient job scheduling for energy and fairness in geographically distributed data centers. Dist Comput Syst. 2012;32:22–31.
  • Zhou G , He T , Stankovic J , et al . RID: radio interference detection in wireless sensor networks. IEEE INFOCOM. 2005;24(2):891–901.
  • Lingxuan H , Evans D . Localization for mobile sensor networks. Mobi Comput Netw. 2004;10:45–57.
  • Kahn JM , Katz RH , Pister KS . Next century challenges: mobile networking for Smart Dust. Mobi Comput Netw. 1999;5:271–278.
  • Sundararaman B , Buy U , Kshemkalyani A . Clock synchronization for wireless sensor networks: a survey. Ad Hoc Netw. 2005;3(3):281–323.
  • Dementyev A , Hodges S , Taylor S , et al . Power consumption analysis of Bluetooth Low Energy, ZigBee and ANT sensor nodes in a cyclic sleep scenario. Intl Wireless Symp. 2013;1:1–4.
  • Martel CU . Maximum finding on a multiple access broadcast network. Inf Proc Lett. 1994;52:7–13.
  • Reed B . The height of a random binary search tree. J ACM. 2003;50(3):306–332.
  • Huang CF , Tseng YC . The coverage problem in a wireless sensor network. Mobi Netw Appl. 2005;10(4):519–528.
  • So A , Ye Y . Theory of semidefinite programming for sensor network localization. Math Prog. 2007;109(2-3):367–384.
  • Xu R , Da H , Wang F , et al . A convex hull based optimization to reduce the data delivery latency of the mobile elements in wireless sensor networks. IEEE Embedded Ubiq Comput. 2013;10:2245–2252.
  • Serna M , Bermudez A , Casado R , et al . A Convex hull-based approximation of forest fire shape with distributed wireless sensor networks. Intl Sens Sens Netw Info Proc. 2011;7:419–424.
  • Kirkpatrick DG , Seidel R . The ultimate planar convex hull algorithm? SIAM J Comput. 1986;15(1):287–299.
  • Raynaud H . Sur l’envelope convexe des nauges des points aléatoires dans ℝ n . Intl J Appl Prob. 1970;7(1):35–48.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.