Topology Control Protocol Research Articles

Prolonging network lifetime and balancing network energy in multi-domain WSNs

The multi-domain wireless sensor networks WSNs are a set of single network co-exist in the same physical location by different authorities. Since nodes in the networks are often battery-limited, the maximisation of network lifetime and the efficiency of balancing energy are important design criterions. In this paper, we present a modified topology control protocol which combines the critical transmitting range CTR and K-neigh topology control strategy. The new algorithm binary network route algorithm based on price, energy and location technology BiPEL is proposed using credit incentive. The results show that the BiPEL algorithm improves the network lifetime and makes the balance of network energy more efficiently. It is also learned that the network lifetime of multi-domain networks is not positive correlation with the cooperation rate.

A Network Topology Control and Identity Authentication Protocol with Support for Movable Sensor Nodes.

It is expected that in the near future wireless sensor network (WSNs) will be more widely used in the mobile environment, in applications such as Autonomous Underwater Vehicles (AUVs) for marine monitoring and mobile robots for environmental investigation. The sensor nodes’ mobility can easily cause changes to the structure of a network topology, and lead to the decline in the amount of transmitted data, excessive energy consumption, and lack of security. To solve these problems, a kind of efficient Topology Control algorithm for node Mobility (TCM) is proposed. In the topology construction stage, an efficient clustering algorithm is adopted, which supports sensor node movement. It can ensure the balance of clustering, and reduce the energy consumption. In the topology maintenance stage, the digital signature authentication based on Error Correction Code (ECC) and the communication mechanism of soft handover are adopted. After verifying the legal identity of the mobile nodes, secure communications can be established, and this can increase the amount of data transmitted. Compared to some existing schemes, the proposed scheme has significant advantages regarding network topology stability, amounts of data transferred, lifetime and safety performance of the network.

Energy-Aware Sink Node Localization Algorithm for Wireless Sensor Networks

Wireless sensor networks (WSNs) are a family of wireless networks that usually operate with irreplaceable batteries. The energy sources limitation raises the need for designing specific protocols to prolong the operational lifetime of such networks. These protocols are responsible for messages exchanging through the wireless communications medium from the sensors to the base station (sink node). Therefore, the determination of the optimal location of the sink node becomes crucial to assure both the prolongation of the network's operation and the quality of the provided services. This paper proposes a novel algorithm based on a Particle Swarm Optimization (PSO) approach for designing an energy-aware topology control protocol. The deliverable of the algorithm is the optimal sink node location within a deployment area. The proposed objective function is based on a number of topology control protocol's characteristics such as numbers of neighbors per node, the nodes’ residual energy, and how they are far from the center of the deployment area. The simulation results show that the proposed algorithm reveals significant effectiveness to both topology construction and maintenance phases of a topology control protocol in terms of the number of active nodes, the topology construction time, the number of topology reconstructions, and the operational network's lifetime.

Performance Comparison of POLY Protocolwith Existing CDS Protocols

This paper consist of Performance Comparison of Proposed protocol with existing CDS Based Topology Control Protocols, In H-V and H-V-D environment. In this paper, we show that in the network, formation of Polygon can provide a reliable and energy efficient topology. Which is the need of mission critical WSN Applications. Based on this logic we propose a new topology control protocol. We call it as Poly protocol. We compare the performance of new protocol with CDS Rule-k & A3; the two CDS based TC protocols. The given simulation results show that Poly performs better in terms of different metrics such as message overhead, energy overhead, Residual Energy etc. It will also show that it achieves better connectivity under dynamic network topologies along with it the Reliability of Poly is also defined & compared it with other CDS-based techniques.

Simulation Time and Energy Test for Topology Construction Protocol in Wireless Sensor Networks

Coverage area and energy consumption are very big challenges in the field of Wireless Sensor Networks (WSNs) as it affects the number of sensors, connectivity and network. Since the sensors are operating on battery of limited power, it is a challenging aim to design an energy efficient Topology Control protocol, which can minimize the energy and thereby extend the lifetime of the network. Through this paper an attempt has been made in terms of simulation time and spent energy in construction of topology in the sensor network by comparing Just Tree and K-neigh Tree protocols. The result shows that K-neigh Tree protocol consumes less energy than Just Tree protocol.

Joint Congestion Control and Packet Scheduling in Wireless Sensor Network

Background: Congestion is the most important starting place for packet drop, escalating queuing delay, small throughput, retransmission of packets, and hence utilization of extra energy, also running down of communication resources. With the aim of surpassing this complication, Joint Congestion Control and Packet Scheduling (JCCPS) mechanism with the help of Space-Time Division Multiple Access (STDMA) is proposed in this research work. Methods: Here, an extended version which makes use of both cluster and tree based strategy is formulated. This builds a node-centric approach that makes a load balanced tree in WSNs of asymmetric structural design. Results: The proposed approach results in less congestion in the complete network, boosts the throughput and at the same time increases the packet delivery ratio (pdr) and also diminishes delay. Moreover, it also boosts network efficiency by the way of increased delivery of packets. Load balancing, network lifetime, and scalability are essential constraints for numerous data collecting sensor network applications. Furthermore, the proposed STDMA packet scheduling approach has enhanced working than the existing schedulers in accordance with the average task waiting time and end-to-end delay. Conclusion: The proposed JCCPS protocol is very effective to determine the constraints which influence the network.Keywords: Congestion Control, Clustering, Cluster Tree Topology, Load Balancing, Packet Scheduling and Congestion Control Protocol, Space-Time Division Multiple Access

On Localized Application-Driven Topology Control for Energy Efficient Wireless Peer-to-Peer File Sharing

Wireless peer-to-peer (P2P) file sharing is widely envisioned as one of the major applications of ad hoc networks in the near future. This trend is largely motivated by the recent advances in high-speed wireless communication technologies and high traffic demand for P2P file sharing applications. To achieve the ambitious goal of realizing a practical wireless P2P network, we need a scalable topology control protocol to solve the neighbor discovery problem and network organization problem. Indeed, we believe that the topology control mechanism should be application driven in that we should try to achieve an efficient connectivity among mobile devices in order to better serve the file sharing application. We propose a new protocol, which consists of two components, namely, adjacency set construction (ASC) and community-based asynchronous wakeup (CAW). Our proposed protocol is shown to be able to enhance the fairness and provide an incentive mechanism in wireless P2P file sharing applications. It is also capable of increasing the energy efficiency.

Topology Control for Harvesting Enabled Wireless Sensor Networks: A Design Approach

While there has been a lot of research on energy efficient topology control protocols destined for different applications, topology control has never been explored in the presence of harvesting enabled sensors. Largely, researchers in this domain have considered a fixed battery design. We argue that arrival of harvesting enabled sensors necessitates rethink of topology control. The objective of topology control in this context should not be to minimize the spent energy and maintain a reduced topology, but to maximize fault tolerance in the network and increase the sensing coverage region. In this work, we first describe a taxonomy of existing topology control schemes and analyze the impact of reduced topology over fault tolerance and sensing coverage. We then describe the necessity of new design parameters in the presence of harvest-able ambient energy. We also outline guiding principles for designing a harvesting enabled topology control scheme. To cater for whether such a scheme is feasible or not, an insight is also provided onto the solar energy availability from solar radiations for near perpetual operation--as an example of available ambient energy. Based on the insight gained from the solar radiations availability, we explain why new design parameters are required for performance measurement of harvesting enabled sensors. The mathematical and empirical findings reveal that the topology control strategies, which do not take into account harvesting opportunity, are unable to provide better results in terms of fault tolerance and sensing coverage.

A Low Energy Clustering Routing Protocol Based on the Partition

In wireless sensor network (WSN), LEACH protocol is a typical representative of the hierarchical topology control protocol. Compared to plane multiple hops routing protocol, it can significantly prolong the life cycle of the network. But LEACH protocol having the problem of uneven distribution at the cluster head election, this paper proposes a low energy adaptive clustering routing protocol based on the partition. On the basis of the partition, cluster heads are selected by the energy of nodes and their location information. Simulation experiments show that the proposed protocol can be more effective than LEACH to balance the energy and improve the life cycle of the network.

A centrality-based topology control protocol for wireless mesh networks

Nodes in wireless multi-hop networks establish links with their neighbors, which are used for data transmission. In general, in this kind of networks every node has the possibility of acting as a router, forwarding the received packets when they are not the final destination of the carried data. Due to the routing protocol procedures, when the network is quite dense the overload added by the routing management messages can be very high. To reduce the effects of this overload a topology control mechanism can be used, which can be implemented using different techniques. One of these techniques consists of enabling or disabling the routing functionality in every node. Many advantages result from selecting just a subset of nodes for routing tasks: reduction of collisions, protocol overhead, interference and energy consumption, better network organization and scalability. In this paper, a new protocol for topology control in wireless mesh networks is proposed. The protocol is based on the centrality metrics developed by social network analysts. Our target network is a wireless mesh network created by user hand-held devices. For this kind of networks, we aim to construct a connected dominating set that includes the most central nodes. The resulting performance using the three most common centrality measures (degree, closeness and betweenness) is evaluated. As we are working with dynamic and decentralized networks, a distributed implementation is also proposed and evaluated. Some simulations have been carried out to analyze the benefits of the proposed mechanism when reactive or proactive routing protocols are used. The results confirm that the use of the topology control contributes to a better network performance.

An Intelligent PSO-based Topology Control Protocol for Wireless Sensor Networks

Topology control protocols try to decrease the average of node’s transition radius without decreasing network connectivity. In this paper, we propose a new Particle Swarm Optimization-based Topology Control protocol for wireless sensor networks called PSOTC. In this protocol, proper transition radius can be determined using Particle Swarm Optimization (PSO) algorithm. The proposed protocol dynamically adjusts transition radius of nodes (unlike previous protocols which should select radius values from among predefined values). Thus, the proposed protocol has some advantages compared to the previous protocols. PSOTC protocol has less average number of neighbors compared to the existing protocols. Also, the energy consumption in our protocol is less than other protocols and the network lifetime will be prolonged. In addition, the network connectivity in our protocol is in the acceptable level. The proposed protocol is simulated and the above advantages are demonstrated by the simulation results.

Energy Efficient Topology Control Protocol for Wireless Sensor Networks

One major problem in the area of Wireless Sensor Networks (WSNs) is the topology control. Topology control protocols in WSNs construct an optimized network topology structure to satisfy the application requirements, such as network connectivity and coverage. In this paper, we deal with the topology control problem by adjusting the transition radius of the sensor nodes. We produce a cluster-based topology control scheme and propose a new Energy Efficient Topology Control Protocol called EETCP. In this protocol, proper transition radius can be determined using Harmony Search (HS) algorithm. The proposed protocol dynamically adjusts transition radius of nodes (unlike some previous protocols which should select radius values among predefined values). Thus, the proposed protocol has some advantage compared to the previous protocols. EETCP has less average number of neighbors compared to the existing protocols. Also, the energy consumption in EETCP is less than other protocols and the network lifetime will be prolonged. In addition, the network connectivity in EETCP is in the acceptable level. The proposed protocol is simulated and the above advantages are demonstrated by the simulation results.

Maximizing Network Lifetime Operator for Wireless Sensor Networks

Optimizing and enhancing network lifetime with minimum energy consumption is the major challenge in field of wireless sensor networks. Existing techniques for optimizing network lifetime are based on exploiting node redundancy, adaptive radio transmission power and topology control. Topology control protocols have a significant impact on network lifetime, available energy and connectivity. In this paper we categorize sensor nodes as strong and weak nodes based on their residual energy as well as operational lifetime and propose a Maximizing Network lifetime Operator (MLTO) that defines cluster based topology control mechanism to enhance network lifetime while guarantying the minimum energy consumption and minimum delay. Extensive simulations in Java-Simulator (J-Sim) show that our proposed operator outperforms the existing protocols in terms of various performance metrics life network lifetime, average delay and minimizes energy utilization.

GTC: a geographical topology control protocol to conserve energy in wireless sensor networks

One of the main design challenges, in wireless sensor networks, is to save energy of sensors and obtain long system lifetime without sacrificing the quality of network coverage and connectivity. Topology control is the primary technique of energy saving. It consists in keeping a minimum number of sensor nodes to operate in active mode with the purpose of conserving energy. It also ensures network connectivity and/or coverage. In this paper, we propose a geographical topology control (GTC) protocol to reduce energy consumption in wireless sensor networks by sleep scheduling among sensor nodes with the purpose to ensure the network connectivity. GTC identifies redundant nodes and organises them into zones so that a connected backbone can be maintained by keeping only one active node in each zone. The redundant ones are turned off. The scheduling strategy, used by GTC, minimises the number of transitions between sleep and active states in order to minimise the transition energy and the leader election freque...

Mobility Prediction in Mobile Ad Hoc Networks Using Extreme Learning Machines

Recent advances in wireless technology and computing have paved the way to the unprecedented rapid growth in de- mand and availability of mobile networking and services coupled with diverse system/network applications. Such advances triggered the emergence of future generation wireless networks and services to address the increasingly strin- gent requirements of quality-of-service (QoS) at various levels. The expected growth in wireless network activity and the number of wireless users will enable similar growth in bandwidth-crunching wireless applications to meet the QoS requirements. Mobility prediction of wireless users and units plays a major role in efficient planning and manage- ment of the bandwidth resources available in wireless networks. In return, this efficiency will allow better planning and improved overall QoS in terms of continuous service availability and efficient power management. In this paper, we propose extreme learning machines (ELMs), known for universal approximation, to model and predict mobility of arbitrary nodes in a mobile ad hoc network (MANET). MANETs use mobility prediction in location-aided routing and mobility aware topology control protocols. In these protocols, each mobile node is assumed to know its current mobility information (position, speed and movement direction angle). In this way, future node positions are predicted along with future distances between neighboring nodes. Unlike multilayer perceptrons (MLPs), ELMs capture better the existing interaction/correlation between the cartesian coordinates of the arbitrary nodes leading to more realistic and accurate mobility prediction based on several standard mobility models. Simulation results using standard mobility models illustrate how the proposed prediction method can lead to a significant improvement over conventional methods based on MLPs. Moreover, the proposed solution circumvents the prediction accuracy limitations in current algorithms when predicting future distances between neighboring nodes. The latter prediction is required by some applications like mobility aware topology control protocols.

Combining Harmony Search and Learning Automata for Topology Control in Wireless Sensor Networks

One of the critical challenges in wireless sensor networks (WSNs) is energy conservation. Topology control is a vital process to minimize energy consumption and maximize the network lifetime. In this paper, we propose a distributed topology protocol with transmission power adjustment based on harmony search and learning automata algorithms called HSLATC (Harmony Search and Learning Automata based Topology Control protocol). In HSLATC, proper transition radius of the sensor nodes can be determined. Because of the intelligent determining the transition radiuses of the nodes in the proposed protocol, it is able to provide the full connectivity in sparse deployment and decreases the energy consumption of the sensor network and prolongs the network lifetime. The simulation results show high efficiency of the proposed protocol.

Energy-Efficient Topology Control in Cooperative Ad Hoc Networks

Cooperative communication (CC) exploits space diversity through allowing multiple nodes cooperatively relay signals to the receiver so that the combined signal at the receiver can be correctly decoded. Since CC can reduce the transmission power and extend the transmission coverage, it has been considered in topology control protocols [1], [2]. However, prior research on topology control with CC only focuses on maintaining the network connectivity, minimizing the transmission power of each node, whereas ignores the energy efficiency of paths in constructed topologies. This may cause inefficient routes and hurt the overall network performance in cooperative ad hoc networks. In this paper, to address this problem, we introduce a new topology control problem: energy-efficient topology control problem with cooperative communication, and propose two topology control algorithms to build cooperative energy spanners in which the energy efficiency of individual paths are guaranteed. Both proposed algorithms can be performed in distributed and localized fashion while maintaining the globally efficient paths. Simulation results confirm the nice performance of all proposed algorithms.

Adaptive neighbor-based topology control protocol for wireless multi-hop networks

Topology control protocols have been proposed to construct efficient network topologies with several design goals, e.g., network-wide connectivity, minimal energy cost, symmetry, lower nodal degree, and therefore higher spatial reuse or lower interferences. Neighbor-based topology control protocols are simple and assume that each node in the network is connected to its k least-distant neighbors. There have been several empirical and theoretical research efforts that recommend a network-wide optimal value of the local parameter k. However, since most of the design goals often run against each other the suggested lower and upper bounds on the values of k are not sufficient to provide a controllable trade-off among various design goals. In this article, an adaptive neighbor-based topology control protocol is presented where the neighboring nodes collaborate and provide feedback on the network connectivity to decide on their respective transmission ranges. Since every node adaptively adjusts its number of neighbors, the parameter k acts as a performance knob to choose a set of backbone nodes and to form a hierarchical topology structure consisting of symmetric links. Through extensive simulation-based study, it is shown that the value of k can be tuned to generate fully connected network topologies while offering an efficient trade-off among various design goals.

Cross‐layer design for topology control and routing in MANETs

AbstractA mobile ad hoc network (MANET) is a self‐organized and adaptive wireless network formed by dynamically gathering mobile nodes. Since the topology of the network is constantly changing, the issue of routing packets and energy conservation become challenging tasks. In this paper, we propose a cross‐layer design that jointly considers routing and topology control taking mobility and interference into account for MANETs. We called the proposed protocol as Mobility‐aware Routing and Interference‐aware Topology control (MRIT) protocol. The main objective of the proposed protocol is to increase the network lifetime, reduce energy consumption, and find stable end‐to‐end routes for MANETs. We evaluate the performance of the proposed protocol by comprehensively simulating a set of random MANET environments. The results show that the proposed protocol reduces energy consumption rate, end‐to‐end delay, interference while preserving throughput and network connectivity. Copyright © 2010 John Wiley & Sons, Ltd.

Self-stabilizing algorithm for efficient topology control in Wireless Sensor Networks

Wireless Sensor Networks lifetime mainly depends on energy saving efficiency. In this paper, we propose an energy-efficient self-stabilizing topology control protocol for WSN. We reduce the transmission power of each node so as to maintain network connectivity while saving maximum energy. Besides, we propose an approximation algorithm for minimum weighted connected dominating set that builds a virtual backbone formed by sensors with maximum energy. This backbone is used for efficient routing purpose. We proved the algorithm correctness and through our simulation results, we showed the efficiency of our proposed solution.