Skip to main content

Algorithmic Foundations of Wireless Networks

Wireless networks have broad coverage from a personal network such as BlueTooth PAN to a small/medium/large scale network such as WAN/5G. There are a number of technologies for implementing direct/multi-hop communications between two wireless peers. Though the wireless networks may be different in size, application areas, particular requirements, and physical/engineering technologies, they have the common fundamental problems that should be resolved by the proper algorithms under certain contexts. For examples, the applications of scheduling, optimization, flow control, and area coverage algorithms exist in all types of wireless networks for the purposes such as MAC, routing, and topology control. The central theme of this special issue is to investigate novel algorithmic solutions for a broad range of wireless network applications and highlight the algorithmic foundations that could serve for multiple similar applications so that researchers can efficiently learn the state of arts in a field, link similar problems under different contexts, and find effective theoretical tools to build the solutions for the specified applications. This special issue encourages submissions of high-quality unpublished papers both reporting original works in theoretical research and the tutorial articles on summarizing the algorithmic foundations that have been applied/investigated to solve similar problems in different applications.         

Edited by: Wei Cheng, Abdallah Khreishah, Ruixuan Li and Hao Wang

  1. Research

    Privacy-preserving combinatorial auction without an auctioneer

    Combinatorial auctions are employed into many applications such as spectrum auctions held by the Federal Communications Commission (FCC). A crucial problem in such auctions is the lack of secure and efficiency...

    Chunqiang Hu, Ruinian Li, Bo Mei, Wei Li, Arwa Alrawais and Rongfang Bie

    EURASIP Journal on Wireless Communications and Networking 2018 2018:38

    Published on: 12 February 2018

  2. Research

    Target guiding self-avoiding random walk with intersection algorithm for minimum exposure path problem in wireless sensor networks

    To solve minimum exposure path (MEP) problem in wireless sensor networks more efficiently, this work proposes an algorithm called target guiding self-avoiding random walk with intersection (TGSARWI), which mim...

    Tinghong Yang, Dali Jiang, Haiyang Fang, Mian Tan, Li Xie and Jing Zhao

    EURASIP Journal on Wireless Communications and Networking 2018 2018:33

    Published on: 6 February 2018

  3. Research

    A hybrid outdoor localization scheme with high-position accuracy and low-power consumption

    As mobile devices, such as smart phones, become more and more popular, localization based on mobile devices has gained much attention in both the academia and industry. Although global positioning system (GPS)...

    Hongwei Du, Chen Zhang, Qiang Ye, Wen Xu, Patricia Lilian Kibenge and Kang Yao

    EURASIP Journal on Wireless Communications and Networking 2018 2018:4

    Published on: 4 January 2018

  4. Research

    Multi-leader election in dynamic sensor networks

    The leader election problem is one of the fundamental problems in distributed computing. Different from most of the existing results studying the multi-leader election in static networks or one leader election...

    Kan Yu, Meng Gao, Honglu Jiang and Guangshun Li

    EURASIP Journal on Wireless Communications and Networking 2017 2017:187

    Published on: 13 November 2017

  5. Research

    Hybrid connectivity restoration in wireless sensor and actor networks

    Wireless sensor and actor networks are becoming more and more popular in the recent years. Each WSAN consists of numerous sensors and a few actors working collaboratively to carry out specific tasks. Unfortuna...

    Ke Yan, Guangchun Luo, Ling Tian, Qi Jia and Chengzong Peng

    EURASIP Journal on Wireless Communications and Networking 2017 2017:138

    Published on: 8 August 2017