Showing papers on "Key distribution in wireless sensor networks published in 2019"

A Dynamic Event-Triggered Transmission Scheme for Distributed Set-Membership Estimation Over Wireless Sensor Networks

Abstract: This paper is concerned with the distributed set-membership estimation for a discrete-time linear time-varying system over a resource-constrained wireless sensor network under the influence of unknown-but-bounded (UBB) process and measurement noise. Sensors collaborate among themselves by exchanging local measurements with only neighboring sensors in their sensing ranges. First, a new dynamic event-triggered transmission scheme (ETS) is developed to schedule the transmission of each sensor’s local measurement. In contrast with the majority of existing static ETSs, the newly proposed dynamic ETS can result in larger average interevent times and thus less totally released data packets. Second, a criterion for designing desired event-triggered set-membership estimators is derived such that the system’s true state always resides in each sensor’s bounding ellipsoidal estimation set regardless of the simultaneous presence of UBB process and measurement noise. Third, a recursive convex optimization algorithm is presented to determine optimal ellipsoids as well as the estimator gain parameters and the event triggering weighting matrix parameter. Furthermore, the proposed dynamic ETS is applied to address the distributed set-membership estimation problem for a discrete-time linear time-varying system with a nonlinearity satisfying a sector constraint. Finally, an illustrative example is given to show the effectiveness and advantage of the developed approach.

Cluster head selection for energy efficient and delay-less routing in wireless sensor network

Abstract: Wireless sensor network (WSN) is comprised of tiny, cheap and power-efficient sensor nodes which effectively transmit data to the base station. The main challenge of WSN is the distance, energy and time delay. The power resource of the sensor node is a non-rechargeable battery. Here the greater the distance between the nodes, higher the energy consumption. For having the effective transmission of data with less energy, the cluster-head approach is used. It is well known that the time delay is directly proportional to the distance between the nodes and the base station. The cluster head is selected in such a way that it is spatially closer enough to the base station as well as the sensor nodes. So, the time delay can be substantially reduced. This, in turn, the transmission speed of the data packets can be increased. Firefly algorithm is developed for maximizing the energy efficiency of network and lifetime of nodes by selecting the cluster head optimally. In this paper firefly with cyclic randomization is proposed for selecting the best cluster head. The network performance is increased in this method when compared to the other conventional algorithms.

Design of Hybrid Wireless and Power Line Sensor Networks With Dual-Interface Relay in IoT

Abstract: The hybrid wireless and power line communication (HWPLC) networks address the problem that mobile wireless sensors and power line communication (PLC) sensors cannot communicate with each other within an Internet of Things (IoT) network. In this paper, we design a relay equipped with a dual wireless and PLC interface, which connects both the PLC and wireless sensors into an IoT network. Furthermore, the dual-interface relay forwards messages by adaptively selecting a interface according to the channel state. A general mathematical probability model of the dual-interface relaying system is presented. The probability density function of the output signal-to-noise ratio (SNR) is developed, which is based on explicit closed-form expressions derived from the statistics character of the PLC and wireless channel. Furthermore, the average capacity, bit-error rate (BER) expressions, and the outage probability formulas are derived. Numerical results show that the HPLWC relaying system with the dual-interface can significantly improve the performance of capacity, BER, and outage probability by adaptively selecting the interface with the optimal received SNR.

Development of Fuzzy based Energy Efficient Cluster Routing Protocol to Increase the Lifetime of Wireless Sensor Networks

Abstract: Wireless Sensor Network is a wide area monitoring tools supporting for Scientific Research, Low-power microscopic sensors. WSN uses limited resource memory, computation power, bandwidth, and energy. The Cluster Routing protocol is the best methodologies for energy efficiency in the wireless sensor network. Cluster Routing Protocols are used to form a cluster creation on the selection of cluster head (CH). Then the data packets are sending from one CH to another CH and finally data packets are send to the base station. CHs are selected by using the setup phase. This system proposed a multi hop transmission, where the data packets are send from one hop to another hop. Finally these data packets are transmitted to the base station. To transmit the packets from source sensor to wireless sensor network base station via the cluster head, using the fuzzy logic type 1with three parameters such as trust factor and distance. The fuzzy logic predicts the nodes, which is having high trust factor, and near to the base station CH will be selected as best forwarder by using Type 1 fuzzy logic. It will direct to increase the life time of network plus reduce the overhead of network.

A rule based delay constrained energy efficient routing technique for wireless sensor networks

Abstract: In wireless sensor networks (WSN), the nodes are used to collect and gather the data from different environments. Hence, the network consumes more energy which is the main and challenging issue in WSNs. Since the sensor is operating under battery, recharging is impossible and hence the lifetime of each sensor is an important issue. Therefore, it is necessary to introduce new and efficient techniques to extend the network lifetime. In this paper, a new delay constrained energy efficient routing technique is proposed for performing effective routing in WSNs. This approach introduces a delay constraint based reliable routing approach which reduces the energy consumption by constructing efficient clusters without increasing the end-to-end delay. Moreover, the proposed technique called the rule based clustering for routing model provides better performance in terms of network lifetime than the other existing techniques since they consume more energy during the formation of clusters and finding the shortest path. Moreover, additional overhead on the cluster head selection is tackled also using rules in this proposed model in an efficient manner by building balanced clusters. The main advantage of the proposed approach is that it extends the lifetime of the network and increases the throughput, energy efficiency, link quality and scalability. The experimental verification of this technique has been carried out using MATLAB simulations and proved that this model increases the packet delivery rate, network performance and reduces the delay and energy consumption.

State Estimation Oriented Wireless Transmission for Ubiquitous Monitoring in Industrial Cyber-Physical Systems

Abstract: State estimation over wireless sensor networks (WSNs) plays an important role for the ubiquitous monitoring in industrial cyber-physical systems (ICPSs). However, the unreliable wireless channels lead to the transmitted measurements arriving at the remote estimator intermittently, which will deteriorate the estimation performance. Question of how to improve the transmission reliability in the hostile industrial environment to guarantee the pre-defined estimation performance for ICPSs is largely unexplored. This paper is concerned with a redundant transmission strategy to meet the reliability requirement for state estimation. This strategy incorporates the ISM channels with the opportunistically harvested channels to provide adequate spectrum opportunities for redundant transmissions. First, we explore the relationship between the estimation performance and the transmission reliability, based on which a joint optimization of channel allocation and power control is then developed to guarantee the estimation performance and maximize the sum rate of the WSN. Second, we formulate the optimization into a mix-integer nonlinear programming problem, which is solved efficiently by decomposing it into the channel allocation and power control subproblems. Ultimately, simulation study demonstrates that the proposed strategy not only ensures the required state estimation performance, but also increases the sum rate of the WSN.

A SAW wireless sensor network platform for industrial predictive maintenance

Abstract: Predictive maintenance predicts the system health, based on the current condition, and defines the needed maintenance activities accordingly. This way, the system is only taken out of service if direct evidence exists that deterioration has actually taken place. This increases maintenance efficiency and productivity on one hand, and decreases maintenance support costs and logistics footprints on the other. We propose a system based on wireless sensor network to monitor industrial systems in order to prevent faults and damages. The sensors use the surface acoustic wave technology with an architecture composed of an electronic interrogation device and a passive sensor (without energy at the transducer) which is powered by the radio frequency transmitted by the interrogation unit. The radio frequency link transfers energy to the sensor to perform its measurement and to transmit the result to the interrogation unit—or in a description closer to the implemented, characterize the cooperative target cross section characteristics to recover the physical quantity defining the transducer material properties. We use this sensing architecture to measure the temperature of industrial machine components and we evaluate the robustness of the method. This technology can be applied to other physical parameters to be monitored. Captured information is transmitted to the base station through multi-hop communications. We also treat interferences involved in both interrogator to interrogator and sensor to interrogator communications.

Cognitive-Node Architecture and a Deployment Strategy for the Future WSNs

Abstract: The advent of sensing and communication technologies represents the next step in the evolution of wireless sensor networks (WSNs) and future applications. Future WSNs systems demand that connected devices could be able to work autonomously, while surfing on-line generated data and process them for self-decision making. Accordingly, we propose a cognitive Information-Centric Sensor Network (ICSN) framework. The fundamentals of cognition in ICSN can be recognized as a promising direction in addressing opportunities and challenges posed by the needs of WSNs. Nevertheless, these fundamental concepts could be difficult to implement due to the wide spectrum of tasks to be covered from the perspective of each device in the WSN. Consequently, we propose the use of Cognitive Nodes (CNs) in typical sensor networks to provide intelligent information processing and knowledge-based services to the end-users. The CNs act on queries from the end-user, containing information about the nature of the request, without the need to modify and/or change any component at the end nodes from where data is collected. We present the detailed architecture and deployment strategy of the cognitive inspired framework that learns and exploits an expanded network information from relays and clustered sensors. Extensive simulation results show that in a network with randomly deployed sensor nodes, CNs can be strategically deployed at pre-determined positions, to ensure that end-user’s Quality of Information (QoI) requirements are met, even under heavy traffic conditions and extensive packets’ payloads. This shows the potential use of ICSN framework in producing the future cognitive applications, while catering to user-desired information quality.

Game-Theory Based Power and Spectrum Virtualization for Optimizing Spectrum Efficiency in Mobile Cloud-Computing Wireless Networks

Abstract: Mobile cloud-computing is a wireless network environment that focuses on sharing the publicly available wireless resources. Wireless network virtualization provides an efficient technique to implement the mobile cloud-computing by enabling multiple virtual wireless networks to be mapped onto one physical substrate wireless network. One of the most important challenges of this technique lies in how to efficiently allocate the wireless resources of physical wireless networks to the multiple virtual wireless network users. To overcome these difficulties, in this paper we propose a set of novel game-theory based schemes to resolve the wireless resources allocation problem in terms of transmit power and wireless spectrum. We formulate this wireless resources allocation problem as the gaming process where each mobile user bids for the limited wireless resources from physical substrate wireless networks, and competes with the other mobile-user players bidding for the same resources. Under our proposed game-theory framework, we develop three types of wireless resources request strategies: price-based strategy, correlation-based strategy, and water-filling-based strategy to allocate wireless resources under three different gaming mechanisms. The extensive simulation results obtained validate and evaluate our proposed schemes.

New Path Centrality Based on Operator Calculus Approach for Wireless Sensor Network Deployment

Abstract: One of the greatest challenges in computing and estimating the important node metrics of a structural graph is centrality. Since centrality is an essential concept in social network analysis (SNA), it is used to define the importance of a node in a network like a wireless sensor network (WSN). Route optimization is another important feature in a wireless sensor network. This paper proposes an alternative solution to route optimization problems by using the multi-constrained optimal path (MCOP) approach. A new metric called path operator calculus (POC) is proposed as an alternative way to determine nodes with high centrality in wireless sensor network deployment. The estimation of this new metric is based on network topology by using the operator calculus approach, which produces the feasible paths for each node to the sink node. In order to define the path centrality of the network, the proposed approach takes into account two constraints for each node: energy and bit error rate (BER). The experimental evaluation shows improved performance in terms of delivery ratio, latency, throughput, delay, energy remaining and routing overhead.

An energy aware competition based clustering for cluster head selection in wireless sensor network with mobility

Abstract: Wireless sensor networks (WSNs) are resource constrained networks wherein every sensor node in the network possesses restricted amount of resources. For saving resources as well as energy, data should be collated for reducing quantity of traffic in the network. Data aggregation is to be carried out with the assistance of a clustering strategy. Cluster-based routing in WSNs is an effective solution for enhancing energy efficacy of nodes as well as resourceful data aggregation. Several studies on network life time as well as data aggregation are suggested with low energy adaptive clustering hierarchy (LEACH) scheme which permits the part of the cluster head (CH) to be rotated amongst the sensor nodes and focuses on the distribution of energy use throughout all nodes. Life time of WSNs are impacted by the choosing of CHs; this is due to the fact that CH consumed more energy than other member nodes. In the current work, an energy effective CH election in mobile WSNs is suggested, analysed as well as evaluated based on residual energy as well as randomized election of nodes that were not designated as CHs in earlier rounds. The study proposes random competition based clustering (RCC) strategy which is more stable than the traditional clustering strategies like Lower ID (LID). IWO or Invasive Weed Optimization is a metaheuristic that has been developed recently to mimic the behaviour of the weeds. But the spatial dispersal operators and reproduction in the IWO that was originally used can make the seeds stay around the weed that is considered best that can result in convergence prematurely. In order to overcome this, EIWO or Enhanced IWO algorithm has been developed using TS or Tabu Search. Furthermore, the suggested method reveals considerable improvement in contrast to IWO LID as well as IWO-TS LID with regard to average end to end delays of sensor nodes, average packet delivery ratio of sensor nodes as well as improved network life time at the time of transmitting information.

A novel trust model of dynamic optimization based on entropy method in wireless sensor networks

Abstract: With the continuous development of wireless sensor networks (WSNs), the existence of malicious nodes poses a great threat to the security of the system. In traditional models based on reputation threshold, the malicious nodes can not be identified accurately with the result of low recognition rate and high false positive rate. To solve the problems of dynamic characteristic and deal with collusion attack in WSNs, a novel trust model of dynamic optimization based on entropy method (Trust-Doe) is proposed. The model is based on the global trust degree of nodes, and logically divides nodes into different groups. Then, the entropy and weight values of the group are calculated based on the entropy weight method, and the local trust degree of the nodes is updated periodically. Finally, the reputation standard deviation of the local evaluation for different groups and local evaluation standard deviation can be obtained, and the dynamic optimization competition strategy will be taken effect to improve the accuracy of trust model. Simulation results show that the improved algorithm is very effective to identify malicious nodes without obvious features.

Anchor node path planning for localization in wireless sensor networks

Abstract: Localization is one of the most important challenges of wireless sensor networks because the location information is typically used in other domains such as coverage, deployment, routing, and target tracking. There exist some localization algorithms that facilitate the sensor nodes to locate itself using the mobile anchor node position. Some crucial attempts have been made in the past for optimizing the mobile anchor node trajectory with good accuracy. This paper presents a novel path planning scheme, D-connect, which ensures the localization of all the sensor nodes with minimum trajectory length. The performance of the proposed scheme is evaluated through a series of simulations. Experimental results reveal that the shortest path for traversing the whole area can be traced with the minimum localization error using this method. It also shows that D-connect outperforms the existing methods in terms of the anchor node trajectory length as well as the localization error.

RF energy harvesting : an analysis of wireless sensor networks for reliable communication

Abstract: In this paper, we consider a wireless energy harvesting network consisting of one hybrid access point (HAP) having multiple antennas, and multiple sensor nodes each equipped with a single antenna. ...

A high-reliability relay algorithm based on network coding in multi-hop wireless networks

Abstract: In multi-hop wireless networks, minimizing the transmission time is very important. In this paper, a high-reliability relay algorithm (HRRA) is proposed to decrease the transmission time based on the network coding in multi-rate environment. The HRRA includes the relay selection algorithm (RSA) and the block transmission algorithm (BTA). Based on the relay reliability of node, RSA chooses the neighbor with the higher link rate as the common relay node and creates more network coding opportunities at the common relay node. Thus, the network coding opportunities and the high-rate links associated with common node could both be exploited in the transmissions of BTA. Moreover, a comprehensive theoretical analysis of the transmission time of HRRA in a block is presented. Lastly, the simulation results show that HRRA can significantly reduce the transmission time compared with the shortest path algorithm and heuristic relay node selection algorithm and COPE.

A data-aware confidential tunnel for wireless sensor media networks

Abstract: A Wireless Sensor Media Network (WSMN) provides an economical and feasible solution to microscopic visual monitoring in real time. Compared to macrographic monitoring (e.g. aerial photography), it can also provide a flexible solution by means of the facility of setup and integration of microscopic data. Security is one of the significant issues for the applications of monitoring due to the visuality of the content in a WSMN. Besides the visual data, the confidentiality of the communication is also important since a WSMN serves as both a media network and a sensor network. Impersonation and key recovery attack are two particular harmful threats to the sensor networks. A spying agent masquerades as a normal node in the network, overhearing the data and signaling. In this paper, we present a data-aware scheme for a wireless sensor media network (WSMN) to guarantee the security of information system against both the impersonation and key recovery attacks during communication. With the consideration of the characteristics of visual data regarding both volatility and correlation, a chaos-driven strategy is used to design the protocol for tunnel establishment. The data-aware scheme is proposed to enhance the security for confidential communication by public key cryptography based attack detection. A simulation and related analysis are presented in this paper. The robustness against anti-attack is also discussed. The results show that the scheme is able to protect the system against both the impersonal intrusion and key recovery attack simultaneously based on data-aware attack-detection.

Energy-Efficient Coalition Formation in Sensor Networks: a Game-Theoretic Approach

Abstract: The most important challenge in Wireless Sensor Networks (WSNs) is the energy constraint. Numerous solutions have been proposed to alleviate the issue, including clustering. Game theory is an effective decision-making tool that has been shown to be effective in solving complex problems. In this paper, we employ cooperative games and propose a new clustering scheme called Coalitional Game-Theoretic Clustering (CGTC) algorithm for WSNs. The idea is to partition the entire network area into two regions, namely far and vicinity, in order to address the hotspot problem in WSNs, wherein nodes close to the base station (BS) tend to deplete their energy faster due to relaying the traffic load received from farther nodes. Then, coalitional games are utilized to group nodes as coalitions. The main factor in choosing coalition heads is the energy level of nodes so that the most powerful nodes play the role of heads. The Shapley value is adopted as the solution concept to our coalitional games. The results of simulations confirm the effectiveness of CGTC in terms of energy efficiency and improved throughput.

Improvement of the Intelligent Tutor by Identifying the Face of the E-Learner's

Abstract: E-healthcare has acquired great importance in recent years and requires the development of innovative solutions. This paper presents a telemonitoring system aimed at enhancing remote healthcare for dependent people at their homes. The system deploys a service-oriented architecture over a heterogeneous Wireless Sensor Networks infrastructure to create smart environments. Such architecture can be executed over multiple wireless devices independently of their microcontroller or the programming language they use. Furthermore, the system allows the interconnection of several networks from different wireless technologies, such as ZigBee or Bluetooth. This approach provides the system better flexibility to change its functionalities and components after deployment than other analyzed proposals. The system description, its architecture, and preliminary results of the system prototype implemented in a real environment are presented.

An enhanced energy optimization routing protocol using double cluster heads for wireless sensor network

Abstract: A challenging research topic in wireless sensor network is prolonging the network lifetime by optimizing the network energy expenditure. The paper explores an enhanced energy optimization routing protocol which uses double cluster heads in a clustering wireless sensor network. The double cluster heads which are determined by energy welfare function are referred to as main cluster head and assistant one, respectively. To balance nodes energy, a formula for the energy overhead is presented to make the sensor node join a temporary cluster with low energy consuming during cluster set-up stage. Then, during the routing selection, relay nodes communicate sensory information to the sink by using combining single-hop and multi-hop technology. The selection of relay nodes depends on the weight values involving information of residual energy, the number of nodes in the cluster, selected times as relay nodes, and a distance between two nodes. The improved protocol is evaluated via simulation experiments and compared with some existing protocols. The simulation results demonstrate that the proposed protocol outperforms the relevant protocols in energy utilization efficiency. Especially, the network lifetime is prolonged due to decreasing energy consuming of the cluster head.

A novel 3- level energy heterogeneity clustering protocol with hybrid routing for a concentric circular wireless sensor network

Abstract: Big data analytics is an emerging field and wireless sensor network is one of the sources of big data.The sensor nodes in the wireless sensor network have limited energy and necessitate efficient energy utilization. Normally, the sensor nodes are randomly deployed in a square network field and applying clustering technique extends the lifetime of the network. In our proposed work, energy efficient concentric circular clustering protocol(EECCCP), the energy heterogeneity normal and the super nodes having flat topology while the advance nodes having clustering topology, are deployed in different zones of concentric circular network field. A hybrid communication with energy heterogeneity increases the network lifetime. The protocol considers the average energy of the network and residual energy of the nodes to select the cluster-heads. Since the network field is circular with the base station at the center and the nodes with same energy are deployed at equal distance from the base station, this topology increases the network life time and stability of the network. The protocol EECCCP has better performance than stable election protocol, zone stable election protocol and distributed energy efficient clustering.

Congestion Control for 6LoWPAN Wireless Sensor Networks: Toward the Internet of Things

Abstract: The Internet of Things (IoT) is the next big challenge for the research community. The IPv6 over low power wireless personal area network (6LoWPAN) protocol stack is considered a key part of the IoT. Due to power, bandwidth, memory and processing resources limitation, heavy network traffic in 6LoWPAN networks causes congestion which significantly degrades network performance and impacts on the quality of service (QoS) aspects. This thesis addresses the congestion control issue in 6LoWPAN networks. In addition, the related literature is examined to define the set of current issues and to define the set of objectives based upon this. An analytical model of congestion for 6LoWPAN networks is proposed using Markov chain and queuing theory. The derived model calculates the buffer loss probability and the number of received packets at the final destination in the presence of congestion. Simulation results show that the analytical modelling of congestion has a good agreement with simulation. Next, the impact of congestion on 6LoWPAN networks is explored through simulations and real experiments where an extensive analysis is carried out with different scenarios and parameters. Analysis results show that when congestion occurs, the majority of packets are lost due to buffer overflow as compared to channel loss. Therefore, it is important to consider buffer occupancy in protocol design to improve network performance. Based on the analysis conclusion, a new IPv6 Routing Protocol for Low-Power and Lossy Network (RPL) routing metric called Buffer Occupancy is proposed that reduces the number of lost packets due to buffer overflow when congestion occurs. Also, a new RPL objective function called Congestion-Aware Objective Function (CA-OF) is presented. The proposed objective function works efficiently and improves the network performance by selecting less congested paths. However, sometimes the non-congested paths are not available and adapting the sending rates of source nodes is important to mitigate the congestion. Accordingly, the congestion problem is formulated as a non-cooperative game framework where the nodes (players) behave uncooperatively and demand high data rate in a selfish way. Based on this framework, a novel and simple congestion control mechanism called Game Theory based Congestion Control Framework (GTCCF) is proposed to adapt the sending rates of nodes and therefore, congestion can be solved. The existence and uniqueness of Nash equilibrium in the designed game is proved and the optimal game solution is computed by using Lagrange multipliers and Karush-Kuhn-Tucker (KKT) conditions. GTCCF is aware of node priorities and application priorities to support the IoT application requirements. On the other hand, combining and utilizing the resource control strategy (i.e. finding non-congested paths) and the traffic control strategy (i.e. adapting sending rate of nodes) into a hybrid scheme is important to efficiently utilize the network resources. Based on this, a novel congestion control algorithm called Optimization based Hybrid Congestion Alleviation (OHCA) is proposed. The proposed algorithm combines traffic control and resource control strategies into a hybrid solution by using the Network Utility Maximization (NUM) framework and a multi-attribute optimization methodology respectively. Also, the proposed algorithm is aware of node priorities and application priorities to support the IoT application requirements.

Water rippling shaped clustering strategy for efficient performance of software define wireless sensor networks

Abstract: The routing protocols are the hot areas to manage the network quality-of-service (QoS), viz., energy consumption, lifetime, network design and packet overhead. Network optimization relies on different calibers of decision: to discuss the network parameters meticulously for overall network improvement. Thus several criteria are proposed which fixate on energy conservation, architecture design, etc. to implicitly or explicitly amend the network performance. We propose a novel strategy named as Water-Rippling Shaped Clustering (WARIS) is a hybrid approach applies to cluster the large-scale software define wireless sensor network, which resembles the shape of water rippling. Major achievements are improved cluster design, energy aware cluster head (CH) selection method and reducing re-clustering overhead. The centrally controlled layer design locally restricted clustered design, and then cluster member selection in WARIS gives better performance as compared to the other two state of the art competitors MCDA and EELBCRP. The to-and-fro message communication between the deployed nodes and BS for exchanging parametric values and making decisions makes this cluster design process lengthy. Load management is done during the process cluster size formation which improves the network performance. Performance simulations illustrate that WARIS is a better choice to implement over wireless sensor networks, predicated on energy consumption and set-up completion time.

Secured and reliable data transmission on multi-hop wireless sensor network

Abstract: Wireless sensor network constitutes a set of distributed senor nodes with no definite infrastructure for transferring and routing the packet. The effective packet transmission through wireless senor networks is a quite challenging task as the malicious nodes might often lead to packet loss or corruption which should be avoided by the reliable method of packet transmission. Hence the present research focuses on employing a novel method for secured transmission of data packets. By proposing the communication and threshold based cryptographic mechanism (CTCM), the insider attackers present in the cluster nodes can be considered for enhancing the security of the wireless sensor network. The behavior of malicious node is first located by keeping some monitoring nodes in the communication environment. The monitoring nodes will communicate the information on malicious node to as much nodes as possible for secured data transmission. The secret keys are also shared to other set of sensor nodes. This ensures that the data can be accessed by the node only when it possesses the specific shares unless which the nodes are refrained from sharing their secret key as it is considered malicious. The evaluation of the experimental results are performed in MATLAB simulation environment and compared with the existing approaches in terms of various performance metrics. The simulation results have proved that the proposed CTCM mechanism shows higher performance compared to other available methods.

Energy minimization in wireless sensor networks by incorporating unequal clusters in multi-sector environment

Abstract: Energy minimization in sensor nodes is the problem in wireless sensor networks (WSNs). The most widely accepted method to preserve energy of sensor nodes is clustering. In cluster based networks, energy consumption is higher in the nodes which are closer to the sink as compared to the nodes which are located farther away from base station (BS). Various unequal clustering algorithms were proposed in the past to correct this issue. The major drawbacks in the findings are that the nodes, which join a specific cluster head, cause overburdening of the cluster head. In this paper, we present an algorithm namely energy efficient unequal sector clustering (EUSC) using multi-sector and unequal clustering approaches which improve the network’s energy efficiency. EUSC divides the network into multiple sectors based on nodes distances from BS. Selection of cluster heads in each sector is based on nodes distances to BS, residual energy and neighbor nodes proximities in that sector. Selection of a relay cluster head for data transmission is also based on residual energy, nodes distances to BS and queue length of nodes. In this paper, we have carried out some theoretical analysis of the nodes energy consumption in each sector and derived an expression for optimal number of clusters in each sector to minimize nodes energy consumption. Various simulations were carried out with MATLAB package to differentiate the competency of the proposed EUSC algorithm with that of the existing protocols ECHA and ‘PSO based protocol’. Simulation results in different network scenarios indicate that EUSC has given much improved performance than ECHA and ‘PSO based protocol’ in terms of number of clusters formed during each round, network lifetime and energy efficiency.

Energy aware and fast authentication scheme using identity based encryption in wireless sensor networks

Abstract: Wireless sensor networks described as an emerging new technology with a very promising future. Advances made in wireless sensor networks (WSNs) are the merging of advanced electronic and wireless technologies. Due to the popularity gained by the wireless environment, Security is the main concern. Node authentication without compromising lifespan of the networks is practically a daunting task. This research work introduces a new model, IBE-ECC that administers the energy of sensor nodes with faster authentication process. Signature verification model is deployed to achieve faster authentication process. Nevertheless, the public key-based strategies eliminate the security process but their verification process takes larger time. Therefore, authentication speed is a major constraint of our research endeavor. The proposed scheme is design to achieve high security and fast authentication with energy efficiency. It uses identity-based encryption on elliptic curve cryptography and a user authentication with an energy efficient key management. Further, to improve the speed of the authentication, it reduces the signature size so that it would accelerate signature verification faster. Hence, the proposed scheme will provide a secure key management, energy efficiency, fast authentication and additionally, computation overhead and communication costs are minimized. Finally, the experimental result demonstrates that the proposed strategy obtains 4797 ms higher execution efficiency and 45. 53% lower computation costs than existing schemes.

Dynamic distributed clustering in wireless sensor networks via Voronoi tessellation control

Abstract: This paper presents two dynamic and distributed clustering algorithms for Wireless Sensor Networks (WSNs). Clustering approaches are used in WSNs to improve the network lifetime and scalability by ...

High-rise structure monitoring with elevator-assisted wireless sensor networking: design, optimization, and case study

Abstract: Wireless sensor networks have been widely suggested to be used in cyber-physical systems for structural health monitoring. However, for nowadays high-rise structures (e.g., the Guangzhou New TV Tower, peaking at 600 m above ground), the extensive vertical dimension creates enormous challenges toward sensor data collection, beyond those addressed in state-of-the-art mote-like systems. One example is data transmission from sensor nodes to the base station. Given the long span of the civil structures, neither a strategy of long-range one-hop data transmission nor short-range hop-by-hop communication is cost-efficient. In this paper, we propose EleSense, a novel high-rise structure monitoring framework that uses elevators to assist data collection. In EleSense, an elevator is attached with the base station and collects data when it moves to serve passengers; as such, the communication distance can be effectively reduced. To maximize the benefit, we formulate the problem as a cross-layer optimization problem and propose a centralized algorithm to solve it optimally. We further propose a distributed implementation to accommodate the hardware capability of sensor nodes and address other practical issues. Through extensive simulations, we show that EleSense has achieved a significant throughput gain over the case without elevators and a straightforward 802.11 MAC scheme without cross-layer optimization. Our distributed implementation in EleSense performs only marginally worse (<1%) than the centralized optimal algorithm. Moreover, EleSense can greatly reduce the communication costs while maintaining good fairness and reliability. Our case study with real experiments and data sets on the Guangzhou New TV Tower further validates the effectiveness of EleSense.

Device and method for wireless communications

Abstract: A device and method for wireless communications. The device includes: an information acquisition unit, configured to acquire channel information about a transmission object and a non-transmission object for wireless communications, wherein the transmission of the transmission object is controlled by the device and transmission of the non-transmission object is not controlled by the device; and an interference reducing unit, configured to reduce interference with the non-transmission object based on the channel information about the transmission object and the non-transmission object.

Wireless communication system and communication method

Abstract: A wireless communication system includes a control device and at least one communication device. The control device includes a scheduler configured to generate control information for a process of a physical layer in wireless communication between the communication device and a terminal, an encoding unit configured to generate encoded data by performing encoding on data to be transmitted to the terminal on the basis of the control information, and a transmission unit configured to transmit the control information to the communication device when the control information is generated and transmits the encoded data to the communication device when the encoded data is generated. The communication device includes a reception unit configured to the control information and the encoded data from the control device; and a signal processing unit configured to perform signal processing for transmitting the encoded data received by the reception unit to the terminal on the basis of the control information received by the reception unit.