Control Message Overhead Research Articles

An Energy Centric Cluster-Based Routing Protocol for Wireless Sensor Networks.

Clustering is an effective way to prolong the lifetime of a wireless sensor network (WSN). The common approach is to elect cluster heads to take routing and controlling duty, and to periodically rotate each cluster head’s role to distribute energy consumption among nodes. However, a significant amount of energy dissipates due to control messages overhead, which results in a shorter network lifetime. This paper proposes an energy-centric cluster-based routing mechanism in WSNs. To begin with, cluster heads are elected based on the higher ranks of the nodes. The rank is defined by residual energy and average distance from the member nodes. With the role of data aggregation and data forwarding, a cluster head acts as a caretaker for cluster-head election in the next round, where the ranks’ information are piggybacked along with the local data sending during intra-cluster communication. This reduces the number of control messages for the cluster-head election as well as the cluster formation in detail. Simulation results show that our proposed protocol saves the energy consumption among nodes and achieves a significant improvement in the network lifetime.

TSRN: A Tabu Search-Based Routing Protocol for Named Data Networking

Information-centric network (ICN) has become a basic research topic with regard to the future architecture of the Internet. Storage and routing data is an important feature of ICN, as it improves network performance and content distribution. One of the challenges in this type of network is the routing problem. The objective of this paper is to propose a routing algorithm in the named data network. Owing to the impressive results presented by the enhanced heuristic methods, tabu search has been selected to develop the proposed algorithm. This work has been carried out in five major steps, Creating the initial solution, The mechanisms of generating a neighborhood, Evaluating the neighbor solutions and selecting the appropriate responses, Updating the answer and the tabu list, Controlling the algorithm termination conditions. The proposed protocol has been implemented in the simulator NS3. Important measures such as the packet delivery ratio, satisfied the interest packets ratio, the average number of interest packets, end-to-end delay, route creation delay, transmission delay, loss rate, and control message overhead have been studied. These show the quality of the proposed protocol. To evaluate the performance of the proposed algorithm, the results of the algorithm were compared with OSPFN and OSPF, which are the most well-known algorithms. The results of this assessment of throughput, control message overhead, packet delivery ratio, and end-to-end delay show that the proposed algorithm has the ability to provide appropriate solutions comparable to these algorithms.

An Efficient Software Defined Data Transmission Scheme based on Mobile Edge Computing for the Massive IoT Environment

This paper presents a novel and efficient data transmission scheme based on mobile edge computing for the massive IoT environments which should support various type of services and devices. Based on an accurate and precise synchronization process, it maximizes data transmission throughput, and consistently maintains a flow’s latency. To this end, the proposed efficient software defined data transmission scheme (ESD-DTS) configures and utilizes synchronization zones in accordance with the 4 usage cases, which are end node-to-end node (EN-EN), end node-to-cloud network (EN-CN), end node-to-Internet node (EN-IN), and edge node-to-core node (EdN-CN); and it transmit the data by the required service attributes, which are divided into 3 groups (low-end group, medium-end group, and high-end group). In addition, the ESD-DTS provides a specific data transmission method, which is operated by a buffer threshold value, for the low-end group, and it effectively accommodates massive IT devices. By doing this, the proposed scheme not only supports a high, medium, and low quality of service, but also is complied with various 5G usage scenarios. The essential difference between the previous and the proposed scheme is that the existing schemes are used to handle each packet only to provide high quality and bandwidth, whereas the proposed scheme introduces synchronization zones for various type of services to manage the efficiency of each service flow. Performance evaluations show that the proposed scheme outperforms the previous schemes in terms of throughput, control message overhead, and latency. Therefore, the proposed ESD-DTS is very suitable for upcoming 5G networks in a variety of massive IoT environments with supporting mobile edge computing (MEC).

Link stable routing with minimal delay nodes for MANETs

Multi-hop routing in mobile ad hoc networks (MANETs) requires good resource managing protocols. The efficient route from source to destination in the network is identified by determining the level of signal strength from intermediate hops. The link quality between the intermediate nodes is determined by calculating the signal strength level. The received signal strength is one method to estimate the medium characteristics and distance between the intermediate nodes which is one of the quality of service required by the network. The nodes with high signal strength and high bandwidth are identified as minimal delay nodes so as to determine the reliable path. The data is sent through minimal delay nodes in the shortest path from source to destination. The better link quality improves the performance metrics such as packet delivery ratio, throughput and simultaneously reduces the control message overheads, average and end-to-end delay compared to some of the existing routing protocols. The experimental study shows that the proposed routing protocol is 30% better in packet delivery ratio, throughput, reduced control message overheads, average and end-to-end delay than the existing stable and delay constrained routing protocol.

An energy-efficient routing scheme by using GPS information for wireless sensor networks

A wireless sensor network (WSN) (or IoT network) is a collection of distributed nodes. These nodes gather data from various sensors and relay that information to a central point through a wireless network. Therefore, the data can be aggregated and have something useful done with it. These types of networks deal primarily with the transmission of small amounts of data that needs to be sent very efficiently. In this paper, we propose an energy-efficient routing algorithm based on the global positioning system (GPS) information. Proposed scheme track the destination's location based on the beacon messages of the main route nodes. Through the experiments, proposed scheme shows improvements in the data packet delivery ratio and reduces the amount of routing control message overhead compared with existing routing protocols such as energy-efficient ant-based routing algorithm (EEABR) and ladder diffusion.

MQRP: Mobile sinks-based QoS-aware data gathering protocol for wireless sensor networks-based smart grid applications in the context of industry 4.0-based on internet of things

The recent advances in internet of things (IoT) and industrial wireless sensor networks (IWSNs) paradigm provide a promising opportunity for upgrading today’s elderly electricity industrial systems and even allow the fourth stage of the industrial revolution, referred to as smart grid industry (SGI) 4.0. In SGI 4.0 paradigm, the WSNs are considered as promising solutions due to their advantages, such as cable replacement, ease of deployment, flexibility, and cost reduction. However, harsh and complex smart grid (SG) environments pose great challenges to guarantee reliable communication for WSNs-based SG applications due to equipment noise, electromagnetic interference, multipath effects and fading in SG environments. This results in deteriorating the quality-of-service (QoS) requirements as well as the network lifetime of multi-hop communication-based WSNs for SG applications. Thus, for SGI 4.0 paradigm to come true, a WSN-based highly reliable communication infrastructure is crucial that will wirelessly connect and integrate power system components for more efficient, reliable, and intelligent operations of the next-generation electricity power grids. To address these challenges, in this paper a novel multi-mobile sinks-based QoS-aware data gathering protocol (called MQRP) for WSNs-based SG applications has been proposed to empower SGI 4.0. The extensive simulations study is carried through a network simulation tool called EstiNet9.0. The obtained experimental facts show that the proposed scheme has not only improved the QoS performance metrics, such as packet delivery ratio, memory utilization, control message overhead, residual energy, network lifetime, and throughput, but also reduced packet error rate and end-to-end delay compared to existing data collection schemes.

An autonomous and efficient controller-based routing scheme for networking Named-Data mobility

The number of routes to store in Named-Data Networking (NDN) requires a huge amount of control messages to exchange because of the Named-Data and the non-aggregated prefixes. Multiple copies of content in different locations and content mobility worsen the scalability challenge. We propose a Controller-based Routing Scheme, named CRoS that runs on top of NDN and, thus, preserves all NDN features using the same interest and data packets. We define specific names and procedures for routers and controller efficient communication over NDN. CRoS adds router actions and avoids control message overhead by coding signaling information on content names. Our scheme enables data mobility and avoids the replications of routing information from controller to routers because they request the routes on-demand. Our proposal also requires low router memory size because it stores only the routes for simultaneously consumed prefixes. Furthermore, the scheme automates router provisioning and efficiently installs a new route, on all routers, in a path with a single Route Request to controller. We provide a protocol proposal description using the Specification and Description Language and we validate the protocol, proving that CRoS behavior is free of dead or live locks. The simulation results show that the efficiency of the proposed scheme is robust when the consumer-interest rate increases with additional throughput of more links. The scheme efficiency is close to optimum when routers operate with enough memory.

Performance Improvement of Cluster-Based Routing Protocol in VANET

Vehicular ad-hoc NETworks (VANETs) have received considerable attention in recent years, due to its unique characteristics, which are different from mobile ad-hoc NETworks, such as rapid topology change, frequent link failure, and high vehicle mobility. The main drawback of VANETs network is the network instability, which yields to reduce the network efficiency. In this paper, we propose three algorithms: cluster-based life-time routing (CBLTR) protocol, Intersection dynamic VANET routing (IDVR) protocol, and control overhead reduction algorithm (CORA). The CBLTR protocol aims to increase the route stability and average throughput in a bidirectional segment scenario. The cluster heads (CHs) are selected based on maximum lifetime among all vehicles that are located within each cluster. The IDVR protocol aims to increase the route stability and average throughput, and to reduce end-to-end delay in a grid topology. The elected intersection CH receives a set of candidate shortest routes (SCSR) closed to the desired destination from the software defined network. The IDVR protocol selects the optimal route based on its current location, destination location, and the maximum of the minimum average throughput of SCSR. Finally, the CORA algorithm aims to reduce the control overhead messages in the clusters by developing a new mechanism to calculate the optimal numbers of the control overhead messages between the cluster members and the CH. We used SUMO traffic generator simulators and MATLAB to evaluate the performance of our proposed protocols. These protocols significantly outperform many protocols mentioned in the literature, in terms of many parameters.

Optimizing Task, Memory and Energy of Wireless Sensor Grids using Grid Cluster based Multilevel Priority Scheduling

With rapid growth of advancements in the field of Internet of Things (IoT), wireless sensor networks are integrated as collaborative constituent for developing insidious smart technologies. Researches based on incorporating grid computing with the wireless sensor network to establish wireless sensor grid are flourishing in this decade to meet the real time requirements. Scheduling is a very vital task in the sensor grid to effectively reduce end to end delay and to control the overhead. In this research work, Multi Level Priority Scheduling (MLPS) scheme is implemented in the sensor grid environment. In order to reduce the energy consumption in the grid, the sensor nodes are grouped as clusters and data communication within the same cluster, across different clusters and from cluster to base station is established based on a novel clustering algorithm called as Grid Cluster. Grid Cluster algorithm combined with Multi Level Priority Scheduling (GCMLPS) is implemented in the sensor grid to optimize the resources including memory awareness, task awareness and energy awareness. Simulation results show the proposed scheme outperforms the existing scheduling mechanisms like First Come First Served Algorithm and the traditional Multi Level Priority scheme in terms of Packet Delivery Rate, Control Message Overhead, Efficiency, Energy Consumption and Routing Tree Cost

Network Intelligence Based on Network State Information for Connected Vehicles Utilizing Fog Computing

This paper proposes a method to take advantage of fog computing and SDN in the connected vehicle environment, where communication channels are unstable and the topology changes frequently. A controller knows the current state of the network by maintaining the most recent network topology. Of all the information collected by the controller in the mobile environment, node mobility information is particularly important. Thus, we divide nodes into three classes according to their mobility types and use their related attributes to efficiently manage the mobile connections. Our approach utilizes mobility information to reduce control message overhead by adjusting the period of beacon messages and to support efficient failure recovery. One is to recover the connection failures using only mobility information, and the other is to suggest a real-time scheduling algorithm to recover the services for the vehicles that lost connection in the case of a fog server failure. A real-time scheduling method is first described and then evaluated. The results show that our scheme is effective in the connected vehicle environment. We then demonstrate the reduction of control overhead and the connection recovery by using a network simulator. The simulation results show that control message overhead and failure recovery time are decreased by approximately 55% and 5%, respectively.

Fog Computing을 적용한 Connected Vehicle 환경에서 상태 정보에 기반한 네트워크 지능화

This paper proposes a method to take advantage of fog computing and SDN in the connected vehicle environment, where communication channels are unstable and the topology changes frequently. A controller knows the current state of the network by maintaining the most recent network topology. Of all the information collected by the controller in the mobile environment, node mobility information is particularly important. Thus, we divide nodes into three classes according to their mobility types and use their related attributes to efficiently manage the mobile connections. Our approach utilizes mobility information to reduce control message overhead by adjusting the period of beacon messages and to support efficient failure recovery. One is to recover the connection failures using only mobility information, and the other is to suggest a real-time scheduling algorithm to recover the services for the vehicles that lost connection in the case of a fog server failure. A real-time scheduling method is first described and then evaluated. The results show that our scheme is effective in the connected vehicle environment. We then demonstrate the reduction of control overhead and the connection recovery by using a network simulator. The simulation results show that control message overhead and failure recovery time are decreased by approximately 55% and 5%, respectively.

Enhancing the Performance of AODV by Exchanging Neighboring Node Information with Hello Packets in VANET

Today's developing innovation of wireless communication is a Vehicular Ad-hoc Network (VANET). VANET is an instance of MANET in which the foundation of wireless scenario is done between vehicles-vehicles and vehicles-roadside Unit (RSU) (12). Mobile nodes in VANET are considered as quick moving vehicles because of which the topology turns out to be very dynamic in nature, which makes it exceedingly supportable for analyzing the security measures for drivers and travelers if there should be an occurrence of any perilous circumstance. AODV is a reactive routing protocol, which has critical influence in the route discovery from source to destination. In this paper, we have acquainted an enhanced strategy with lessening the overhead of control messages from the network by sharing the information through HELLO messages, and expansion the execution of AODV in VANET environment.

Service Discovery in Mobile Ad-Hoc Networks of Android OS Devices

ad-hoc networks have been deployed for communication where infrastructure based communications are not available (or desirable). Android OS ad-hoc networks can be employed in development of collaborative applications such as entertainment systems and mobile gaming. In addition, they facilitate ubiquitous computing in areas such as home applications where wireless sensors and actuators are embedded in consumer electronics. This paper presents an implementation of Service Discovery middleware for Android Mobile ad-hoc networks. The implementation overlays a Mobile Ad-hoc Network implementation. It further describes a routing implementation that is based on the Ad-hoc On-Demand Distance Vector protocol, with modifications to reduce control message overhead. An implementation of a Semantic approach for description of services on mobile devices, that facilitates semantic service discovery in Android OS Mobile Ad Hoc Networks is also presented. The implementation was tested by simulating the routing implementation. An Android based prototype was developed and tested on a range of devices.

A learning automata and clustering-based routing protocol for named data networking

Named data networking (NDN) is a new information-centric networking architecture in which data or content is identified by a unique name and saved pieces of the content are used in the cache of routers. Certainly, routing is one of the major challenges in these networks. In NDN, to achieve the required data for users, interest messages containing the names of data are sent. Because the source and destination addresses are not included in this package, routers forward them using the names that carried in packages. This forward will continue until the interest package is served. In this paper, we propose a routing algorithm for NDN. The purpose of this protocol is to choose a path with the minimum cost in order to enhance the quality of internet services. This is done using learning automata with multi-level clustering and the cache is placed in each cluster head. Since the purpose of this paper is to provide a routing protocol and one of the main rules of routing protocol in NDN is that alternative paths should be found in each path request, so, we use multicast trees to observe this rule. One way of making multicast trees is by using algorithms of the Steiner tree construction in the graph. According to the proposed algorithm, the content requester and content owners are the Steiner tree root and terminal nodes, respectively. Dijkstra's algorithm is one of the proper algorithms in routing which is used for automata convergence. The proposed algorithm has been simulated in NS2 environment and proved by mathematical rules. Experimental results show the excellence of the proposed method over the one of the most common routing protocols in terms of the throughput, control message overhead, packet delivery ratio and end-to-end delay.

A hierarchical P2P clustering framework for video streaming systems

In this study, a novel overlay architecture for constructing hierarchical and scalable clustering of Peer-to-Peer (P2P) networks is proposed. The proposed architecture attempts to enhance the clustering of peers by incorporating join, split, merge and cluster leader election mechanisms in a fully distributed manner. It takes delay proximity of peers into account as distance measure. By constructing hierarchical clustering of peers, the control message overhead and maintenance such as host departure/host join overhead are decreased. Theoretical comparisons on overheads of the proposed system with that of other systems from literature are studied. The control mechanism for dynamic peer behavior of the architecture is tested over PlanetLab. The performance metrics used are end-to-end delay, diameter, cluster head distance, occupancy rate, peer join latency, accuracy and correctness. The test results are compared with Hierarchical Ring Tree (HRT) and mOverlay architecture. In addition, a P2P video streaming application is run over the proposed network overlay. Streaming tests show that video streaming applications perform well in terms of received video quality if hierarchical clusters considering delay proximity are used as underlying network architecture.

A Multipath Prefix Routing for Wireless Sensor Networks

When a spanning tree is built on top of a wireless network and an appropriate labelling scheme is applied, the complexity of the routing mechanism in terms of memory usage and control messages can be drastically reduced using compact routing. In this paper, we propose multipath prefix routing (MPR), a multipath routing protocol for wireless sensor networks. MPR is a hybrid (both reactive and proactive) protocol that operates on an already built spanning tree rooted at the sink (the collect station). Besides the tree path, additional paths are built based on an appropriate labelling scheme and neighbourhood relationships. For practical implementation, we propose and evaluate two different labelling schemes. We mainly show that in a perfect W-ary tree, the additional number of bits required to encode labels is at most $$(H-1)$$(H-1) where H is the height of the tree. Finally, we apply MPR to the ZigBee standard and evaluate its performance using simulations. MPR has a small state routing while control messages overhead is maintained low compared to traditional multipath routing protocols.

DARAL: A Dynamic and Adaptive Routing Algorithm for Wireless Sensor Networks

The evolution of Smart City projects is pushing researchers and companies to develop more efficient embedded hardware and also more efficient communication technologies. These communication technologies are the focus of this work, presenting a new routing algorithm based on dynamically-allocated sub-networks and node roles. Among these features, our algorithm presents a fast set-up time, a reduced overhead and a hierarchical organization, which allows for the application of complex management techniques. This work presents a routing algorithm based on a dynamically-allocated hierarchical clustering, which uses the link quality indicator as a reference parameter, maximizing the network coverage and minimizing the control message overhead and the convergence time. The present work based its test scenario and analysis in the density measure, considered as a node degree. The routing algorithm is compared with some of the most well known routing algorithms for different scenario densities.

An Energy-Efficient Hybrid Routing Method for Wireless Sensor Networks with Mobile Sink

In wireless sensor networks (WSN), nodes usually use multi-hop communication to transmit sensed data to the base station. Consequently, sensors near the sink deplete their energy quickly and the sink will be isolated from the network. Moving the sink all around the network can alleviate this problem. Yet, sink mobility causes some challenging issues in WSNs which makes it almost impossible to use the classic routing protocols of WSNs with static sink. Therefore, it is required to develop new routing protocols or extend the existing ones. This paper presents an energy-efficient hybrid routing method for WSNs with mobile sink that combines proactive and reactive schemes. Our model is also applicable to the battlefield with a vehicle as the mobile sink. The primary objective of the proposed method is to increase the lifetime of sensor networks by reducing control messages and average hop counts, different traffic patterns flexibility and the protocol usability for most applications. The proposed method suggests several new algorithms to fulfill its purposes. Simulation results confirm that the proposed method extends the network lifetime from 5 to 9 % compared to the existing techniques. A distinguishing attribute of this method is the decreased amount of control message overhead compared with similar approaches.

Relay selection for maximizing the number of successive transmission in cooperative networks

Relay selection has an important effect on improving the performance of cooperative communication system. However, the frequent operation of relay selection can bring enormous control message overhead, and then decrease the performance of cooperative communication. To reduce the relay selection frequency, in this paper, we propose a relay selection scheme to choose the best relay considering successive packets transmission. In this scheme, through the parameters of data transmission rate, the length of data packet and the estimated channel state information, the best relay is selected to maximize the number of successive packets transmission while guaranteeing the given outage probability. It is proven by numerical results that the proposed relay selection scheme can support the successive packets transmission in cooperative wireless networks and the maximum number of successive packets transmission is affected by the different network parameters, i.e. packet length, data transmission rate, signal to noise ratio and Doppler frequency. Compared to previous relay selection schemes by simulation results, it is shown that the proposed relay selection scheme can improve the throughput performance efficiently.

Energy-Efficient Hybrid CCC-Based MAC Protocol for Cognitive Radio Ad Hoc Networks

Transmitter power consumption and application throughput in cognitive radio-medium access control (CR-MAC) protocol has direct impact on control message overhead and common control channel (CCC). Hence, the design of CCC in CR-MAC plays a pivotal role in selecting an energy-efficient channel path for enhanced throughput. State-of-the-art CR-MAC protocols design CCC in in-band or out-of-band overlay spectrum bands. With in-band, imperfect node synchronization due to per-hop and group CCC coverage leads to multichannel hidden terminal and longer network access delays. Global coverage with dedicated out-of-band CCC is subject to saturation and intruder attacks, which results in single point of network failure and increased power consumption. To overcome existing problems, an energy-efficient hybrid CCC based CR-MAC protocol with omnidirectional control and directional data transmission is proposed to reduce power consumption due to link access overhead, multichannel hidden terminal, deafness, and spectrum mobility. In this paper, antenna index numbers through Global Positioning System and angle-of-arrival estimation are used for directional data transmission, whereas hybrid CCC is used to avoid interference due to multichannel hidden terminals. Experimental results reveal that the proposed hybrid CCC-MAC with directional antennas has increased network throughput and reduced transmit power consumption when compared with existing in/out-of-band omnidirectional CCC-based CR-MAC protocols.