A wireless sensor network (WSN) is emerging as an innovative method for gathering information that will significantly improve the reliability and efficiency of infrastructure systems. Broadcast is a common method to disseminate information in WSNs. A variety of counter-based broadcast schemes have been proposed to mitigate the broadcast-storm problems, using the count threshold value and a random access delay. However, because of the limited propagation of the broadcast-message, there exists a trade-off in a sense that redundant retransmissions of the broadcast-message become low and energy efficiency of a node is enhanced, but reachability become low. Therefore, it is necessary to study an efficient counter-based broadcast scheme that can dynamically adjust the random access delay and count threshold value to ensure high reachability, low redundant of broadcast-messages, and low energy consumption of nodes. Thus, in this paper, we first measure the additional coverage provided by a node that receives the same broadcast-message from two neighbor nodes, in order to achieve high reachability with low redundant retransmissions of broadcast-messages. Second, we propose a new counter-based broadcast scheme considering the size of the additional coverage area, distance between the node and the broadcasting node, remaining battery of the node, and variations of the node density. Finally, we evaluate performance of the proposed scheme compared with the existing counter-based broadcast schemes. Simulation results show that the proposed scheme outperforms the existing schemes in terms of saved rebroadcasts, reachability, and total energy consumption.
A variety of recent studies have attempted to apply biologically inspired (bio-inspired) algorithms to distributed resource allocation problems because they promise to enable efficient decentralized communication. In this article, we discuss the key challenges of MANETs with respect to bandwidth utilization, fairness, scalability, QoS, energy efficiency, and mobility. We also provide an overview of the state of the art of bio-inspired algorithms for resource allocation and describe the key benefits of using bio-inspired resource allocation algorithms in order to solve the various challenges of MANETs. Using the underlying key features of such bio-inspired algorithms, we design and implement a framework for a bio-inspired MAC protocol suited to MANETs and evaluate its performance. A simulation verifies that the proposed MAC protocol outperforms the existing MAC protocols in terms of throughput, delay, fairness, overhead, and energy efficiency. Finally, we discuss open issues associated with application of bio-inspired algorithms to resource allocation in MANETs.
Long Range Wide Area Network (LoRaWAN) is the one of the promising low power wide area network (LPWAN) technologies at present and is expected to grow in the foreseeable future as a tool to provide connectivity among small things. In this paper, we present a simple analytical model to compute the throughput and packet loss probability of Medium Access Control (MAC) for Class-A of LoRaWAN. This analysis results can be used as a reference for deploying the appropriate number of end-devices (EDs) that can be accepted in a gateway (GW) while maximizing network throughput or guaranteeing the packet loss rate of EDs.
With the arrival of the era of Internet of Things (IoT), Wi-Fi Direct is becoming an emerging wireless technology that allows one to communicate through a direct connection between the mobile devices anytime, anywhere. In Wi-Fi Direct-based IoT networks, all devices are categorized by group of owner (GO) and client. Since portability is emphasized in Wi-Fi Direct devices, it is essential to control the energy consumption of a device very efficiently. In order to avoid unnecessary power consumed by GO, Wi-Fi Direct standard defines two power-saving methods: Opportunistic and Notice of Absence (NoA) power-saving methods. In this paper, we suggest an algorithm to enhance the energy efficiency of Wi-Fi Direct power-saving, considering the characteristics of multimedia video traffic. Proposed algorithm utilizes the statistical distribution for the size of video frames and adjusts the lengths of awake intervals in a beacon interval dynamically. In addition, considering the inter-dependency among video frames, the proposed algorithm ensures that a video frame having high priority is transmitted with higher probability than other frames having low priority. Simulation results show that the proposed method outperforms the traditional NoA method in terms of average delay and energy efficiency.
Recently, the development of wireless body area sensor network (WBASN) has accelerated due to the rapid development of wireless technology. In the WBASN environment, many WBASNs coexist where communication ranges overlap with each other, resulting in the possibility of interference. Although nodes in a WBASN typically operate at a low power level, to avoid adversely affecting the human body, high transmission rates may be required to support some applications. In addition to this, since many varieties of applications exist in the WBASN environment, each prospective user may have different quality of service (QoS) requirements. Hence, the following issues should be considered in the WBASN environment: (1) interference between adjacent WBASNs, which influences the performance of a specific system, and (2) the degree of satisfaction on the QoS of each user, i.e., the required QoS such as user throughput should be considered to ensure that all users in the network are provided with a fair QoS satisfaction. Thus, in this paper, we propose a transmission power adjustment algorithm that addresses interference problems and guarantees QoS fairness between users. First, we use a new utility function to measure the degree of the satisfaction on the QoS for each user. Then, the transmission power of each sensor node is calculated using the Cucker–Smale model, and the QoS satisfaction of each user is synchronized dispersively. The results of simulations show that the proposed algorithm performs better than existing algorithms, with respect to QoS fairness and energy efficiency.
Fair resource allocation in a wireless multihop (MH) network is very important for ensuring high bandwidth reuse and high end-to-end throughput without a bottle-neck problem. However, it is very challenging because the available bandwidth for a node in wireless MH networks is limited by both the number of neighboring nodes and their geographic locations, which are always changeable due to users’ mobility. To address this problem, we propose a distributed resource allocation algorithm that enables collision-free and fair resource allocation among neighbors within two-hop distance. In the proposed algorithm, each node has a phase that linearly increases from 0 to 1 with a period of 1, and shares the phase information with its one- and two-hop neighbors. The shared phase information is used for distributed fair resource allocation for each node in a time division multiple access (TDMA) based network. We elaborate various characteristics of the proposed algorithm attributed to the MH properties. The necessary condition to ensure stability of the proposed algorithm is derived and analytically proved. Simulation results verify the stability of the proposed algorithm under various scenarios, and show faster convergence and higher bandwidth reuse compared to a comparison algorithm.