Modeling of Node Energy Consumption for Wireless Sensor Networks

Energy consumption is the core issue in wireless sensor networks (WSN). To generate a node energy model that can accurately reveal the energy consumption of sensor nodes is an extremely important part of protocol development, system design and performance evaluation in WSNs. In this paper, by studying component energy consumption in different node states and within state transitions, the authors present the energy models of the node core components, including processors, RF modules and sensors. Furthermore, this paper reveals the energy correlations between node components, and then establishes the node energy model based on the event-trigger mechanism. Finally, the authors simulate the energy models of node components and then evaluate the energy consumption of network protocols based on this node energy model. The proposed model can be used to analyze the WSNs energy consumption, to evaluate communication protocols, to deploy nodes and then to construct WSN applications.

Modelling and Analysis of TCP Performance in Wireless Multihop Networks

Researchers have used extensive simulation and experimental studies to understand TCP performance in wireless multihop networks. In contrast, the objective of this paper is to theoretically analyze TCP performance in this environment. By examining the case of running one TCP session over a string topology, a system model for analyzing TCP performance in multihop wireless networks is proposed, which considers packet buffering, contention of nodes for access to the wireless channel, and spatial reuse of the wireless channel. Markov chain modelling is applied to analyze this system model. Analytical results show that when the number of hops that the TCP session crosses is ?xed, the TCP throughput is independent of the TCP congestion window size. When the number of hops increases from one, the TCP throughput decreases ?rst, and then stabilizes when the number of hops becomes large. The analysis is validated by comparing the numerical and simulation results.

Virtualized Wireless SDNs:Modelling Delay Through the Use of Stochastic Network Calculus

Software-defined networks （SDN） have attracted much attention recently because of their flexibility in terms of network management. Increasingly, SDN is being introduced into wireless networks to form wireless SDN. One enabling technology for wireless SDN is network virtualization, which logically divides one wireless network element, such as a base station, into multiple slices, and each slice serving as a standalone virtual BS. In this way, one physical mobile wireless network can be partitioned into multiple virtual networks in a software-defined manner. Wireless virtual networks comprising virtual base stations also need to provide QoS to mobile end-user services in the same context as their physical hosting networks. One key QoS parameter is delay. This paper presents a delay model for software-defined wireless virtual networks. Network calculus is used in the modelling. In particular, stochastic network calculus, which describes more realistic models than deterministic network calculus, is used. The model enables theoretical investigation of wireless SDN, which is largely dominated by either algorithms or prototype implementations.

Virtual reality mobility model for wireless ad hoc networks

For wireless ad hoc networks simulation, node＇s mobility pattern and traffic pattern are two key elements. A new simulation model is presented based on the virtual reality collision detection algorithm in obstacle environment, and the model uses the path planning method to avoid obstacles and to compute the node＇s moving path. Obstacles also affect node＇s signal propagation. Considering these factors, this study implements the mobility model for wireless ad hoc networks. Simulation results show that the model has a significant impact on the performance of protocols.

An Energy-Based Stochastic Model for Wireless Sensor Networks

We propose an energy-based stochastic model of wireless sensor networks (WSNs) where each sensor node is randomly and alternatively in an active and a sleep mode. We first investigate the sensor model and derive the formula of the steady-state probability when there are a number of data packets in different sensor modes. We then determine important sensor’s performance measures in terms of energy consumptions, average data delay and throughput. The novelty of this paper is in its development of a stochastic model in WSN with active/sleep feature and the explicit results obtained for above mentioned energy consumption and performance characteristics. These results are expected to be useful as the fundamental results in the theoretical analysis and design of various hybrid WSNs with power mode consideration.

Research on Beta Trust Model of Wireless Sensor Networks Based on Energy Load Balancing

This paper proposed beta trust model based on energy load balancing combines the recent achievements of the trust models in distributed networks, together with the characteristics of wireless sensor networks. The inter-node trust relation is established after an overall evaluation of node trust value based on the monitor results of the node packets forwarding behavior conducted by inter-node collaboration. Due to the node energy limitation in wireless sensor networks, energy load balancing mechanism is applied to prolong the node survival time. And the redundant routing protocol involves the presented trust model to develop the novel trust routing protocol of beta trust model based on energy load balancing. Simulation performance demonstrates that the beta trust model based on energy load balancing outperforms current schemes in energy consumption.

Management of Intelligent Campus Wireless Sensor Networks Based on Runtime Model

To quick customize and develop intelligent campus internet of things (ICIOT) system more efficiently, in this paper an approach based on runtime model to managing intelligent campus wireless sensor networks is proposed. Firstly, manageability of intelligent campus wireless sensors is abstracted as runtime models which automatically and immediately propagate any observable runtime changes of target resources to corresponding architecture models. Then, a composite model of intelligent campus wireless sensors is constructed through merging their runtime models in order to manage different kinds of devices in a unified way. Finally, a customized model is constructed according to the personalized management requirement and the synchronization between the customized model and the composite model is ensured through model transformation. Thus, all the management tasks can be carried through executing operating programs on the customized model. In the part of the teaching area schools conducted experiments and compared with the traditional method, this method can be more effective management of campus facilities, more energy efficient and orderly, which can reach a 16.7% energy saving.

An Application-Oriented Network Model for Wireless Sensor Networks

Wireless sensor networks (WSNs) are energy-constrained networks. The residual energy real-time monitoring (RERM) is very important for WSNs. Moreover, network model is an important foundation of RERM research at personal area network (PAN) level. Because RERM is inherently application-oriented, the network model adopted should also be application-oriented. However, many factors of WSNs applications such as link selected probability and ACK mechanism etc. were neglected by current network models. These factors can introduce obvious influence on throughput of WSNs. Then the energy consumption of nodes will be influenced greatly. So these models cannot characterize many real properties of WSNs, and the result of RERM is not consistent with the real-world situation. In this study, these factors neglected by other researchers are taken into account. Furthermore, an application-oriented general network model (AGNM) for RERM is proposed. Based on the AGNM, the dynamic characteristics of WSNs are simulated. The experimental results show that AGNM can approximately characterize the real situation of WSNs. Therefore, the AGNM provides a good foundation for RERM research.

Efficient Cover Set Selection in Wireless Sensor Networks

到大程度，一个基于簇的分布式的传感器网络的有效性取决于传感器节点提供的范围。在任何特别时刻激活仅仅传感器节点的必要数字是节省全面精力的一个有效方法。然而，因为无线传感器网络的高密度的推广，这是一个 NP 完全的问题。在这份报纸，基于改进 NSGA-II (排序基因算法的优秀人材 nondominated ) 寻找算法的一篇小说被建议选择一个最佳的盖子集合。与在以前的工作使用的二进制察觉模型相对照，一个概率的察觉模特儿与察觉错误范围和范围阀值在联合被收养。与被保证的完整的网络范围，很多个节点被转变为休眠模式节省精力。传播联合并且删除操作员被建议提高搜索能力。广泛的模拟结果被介绍表明我们的途径的有效性。

An Analytical Framework for Disconnection Prediction in Wireless Networks

The stability and reliability of links in wireless networks is dependent on a number of factors such as the topology of the area, inter-base station or inter-mobile station distances, weather conditions and so on. Link instability in wireless networks has a negative impact on the data throughput and thus, the overall quality of user experience, even in the presence of sufficient bandwidth. An estimation of link quality and link availability duration can drastically increase the performance of these networks, allowing the network or applications to take proactive measures to handle impending disconnections. In this paper we look at a mathematical model for predicting disconnection in wireless networks. This model is originally intended to be implemented in base stations of cellular networks, but is independent of the wireless technology and can thus be applied to different types of networks with minimum changes.

Virus spreading in wireless sensor networks with a medium access control mechanism

In this paper, an extended version of standard susceptible-infected （SI） model is proposed to consider the influence of a medium access control mechanism on virus spreading in wireless sensor networks. Theoretical analysis shows that the medium access control mechanism obviously reduces the density of infected nodes in the networks, which has been ignored in previous studies. It is also found that by increasing the network node density or node communication radius greatly increases the number of infected nodes. The theoretical results are confirmed by numerical simulations.

Effect of interference on transmission for newly deployed wireless sensor networks

The co-channel interference(collisions) seriously affect the transmission for the newly deployed wireless sensor networks since there is no structure at that phase.In this paper,the interference of the whole network is analyzed based on the SNIR model.The new concept of critical transmitting range is proposed,based on which the transmission theorem is obtained and proved.The results provide the theoretical ground to set up the primary structure of newly deployed networks.

Low Power Transceiver Design Parameters for Wireless Sensor Networks

Designing low power sensor networks has been the general goal of design engineers, scientist and end users. It is desired to have a wireless sensor network (WSN) that will run on little power (if possible, none at all) thereby saving cost, and the inconveniences of having to replace batteries in some difficult to access areas of usage. Previous researches on WSN energy models have focused less on the aggregate transceiver energy consumption models as compared to studies on other components of the node, hence a large portion of energy in a WSN still get depleted through data transmission. By studying the energy consumption map of the transceiver of a WSN node in different states and within state transitions, we propose in this paper the energy consumption model of the transceiver unit of a typical sensor node and the transceiver design parameters that significantly influences this energy consumption. The contribution of this paper is an innovative energy consumption model based on simple finite automata which reveals the relationship between the aggregate energy consumption and important power parameters that characterize the energy consumption map of the transceiver in a WSN;an ideal tool to design low power WSN.

A Secure and Energy-Balanced Routing Scheme for Mobile Wireless Sensor Network

Mobile wireless sensor network (MWSN) has the features of self-organization, multiple-hop and limited energy resources. It is vulnerable to a wide set of security attacks, including those targeting the routing protocol functionality. In this paper, the existing security problems and solutions in MWSN are summarized, and then a trust management system based on neighbor monitoring is proposed. In the trust management system, the trust value is calculated by the neighbor monitoring mechanism, and the direct trust value and the indirect trust value are combined to establish the distributed trust model to detect the malicious nodes. The consistency check algorithm is capable of defending against the attacks on the trust model. In addition, because of the limited energy of the sensor nodes, the energy-balanced algorithm is introduced to prolong the lifespan of MWSN. The residual energy and energy density are considered in the routing decision. Finally, the simulation experiments show that the proposed algorithm can detect the malicious nodes effectively and achieve the energy-balanced goal to prolong the lifespan of MWSN.

RESEARCH ON KEY NODES OF WIRELESS SENSOR NETWORK BASED ON COMPLEX NETWORK THEORY

On the basis of complex network theory, the issues of key nodes in Wireless Sensor Networks (WSN) are discussed. A model expression of sub-network fault in WSN is given at first; subsequently, the concepts of average path length and clustering coefficient are introduced. Based on the two concepts, a novel attribute description of key nodes related to sub-networks is proposed. Moreover, in terms of node deployment density and transmission range, the concept of single-point key nodes and generalized key nodes of WSN are defined, and their decision theorems are investigated.

Mobility Conscious Medium Access Control Scheme for Wireless Sensor Networks: A Conceptual Approach

Mobility in Wireless Sensor Network (WSN) presents distinctive challenges in Medium Access Control (MAC) scheme. Numerous MAC protocols for sensor networks assume that sensor nodes are static and focus primarily on energy efficiency. This work seeks to develop an improved mobility conscious medium access control scheme for wireless sensor networks with a view to enhance energy conservation on mobile sensor nodes. On this note, mobility patterns of different scenarios are modelled using Gauss Markov Mobility Model (GMMM) to determine the position and distance of the sensor nodes and how they are correlated in time.

A Chain Routing Algorithm Based on Traffic Prediction in Wireless Sensor Networks

As a representative of chain-based protocol in Wireless Sensor Networks (WSNs), EEPB is an elegant solution on energy efficiency. However, in the latter part of the operation of the network, there is still a big problem: reserving energy of the node frequently presents the incapacity of directly communicating with the base station, at the same time capacity of data acquisition and transmission as normal nodes. If these nodes were selected as LEADER nodes, that will accelerate the death process and unevenness of energy consumption distribution among nodes.This paper proposed a chain routing algorithm based ontraffic prediction model (CRTP).The novel algorithmdesigns a threshold judgment method through introducing the traffic prediction model in the process of election of LEADER node. The process can be dynamically adjusted according to the flow forecasting. Therefore, this algorithm lets the energy consumption tend-ing to keep at same level. Simulation results show that CRTP has superior performance over EEPB in terms of balanced network energy consumption and the prolonged network life.

A Multipath Routing Algorithm Based on Traffic Prediction in Wireless Mesh Networks

The technology of QoS routing has become a great challenge in Wireless Mesh Networks (WMNs). There exist a lot of literatures on QoS routing in WMNs, but the current algorithms have some deficiencies, such as high complexity, poor scalability and flexibility. To solve the problems above, a multipath routing algorithm based on traffic prediction (MRATP) is proposed in WMNs. MRATP consists of three modules including an algo-rithm on multipath routing built, a congestion discovery mechanism based on wavelet-neural network and a load balancing algorithm via multipath. Simulation results show that MRATP has some characteristics, such as better scalability, flexibility and robustness. Compared with the current algorithms, MRATP has higher success ratio, lower end to end delay and overhead. So MRATP can guarantee the end to end QoS of WMNs.

A Quantitative Analysis of Collision Resolution Protocol for Wireless Sensor Network

In this paper, we present formal analysis of 2CS-WSN collision resolution protocol for wireless sensor networks using probabilistic model checking. The 2CS-WSN protocol is designed to be used during the contention phase of IEEE 802.15.4. In previous work on 2CS-WSN analysis, authors formalized protocol description at abstract level by defining counters to represent number of nodes in specific local state. On abstract model, the properties specifying individual node behavior cannot be analyzed. We formalize collision resolution protocol as a Markov Decision Process to express each node behavior and perform quantitative analysis using probabilistic model checker PRISM. The identical nodes induce symmetry in the reachable state space which leads to redundant search over equivalent areas of the state space during model checking. We use “ExplicitPRISMSymm” on-the-fly symmetry reduction approach to prevent the state space explosion and thus accommodate large number of nodes for analysis.

Radio Coverage Mapping in Wireless Sensor Networks

Radio coverage directly affects the network connectivity, which is the foundational issue to ensure the normal operation of the network. Many efforts have been made to estimate the radio coverage of sensor nodes. The existing approaches (often RSSI measurement-based), however, suffer from heavy measurement cost and are not well suitable for the large-scale densely deployed WSNs. NRC-Map, a novel algorithm is put forward for sensor nodes radio coverage mapping. The algorithm is based on the RSSI values collected by the neighbor nodes. According to the spatial relationship, neighbor nodes are mapping to several overlapped sectors. By use of the least squares fitting method, a log-distance path loss model is established for each sector. Then, the max radius of each sector is computed according to the path loss model and the given signal attenuation threshold. Finally, all the sectors are overlapped to estimate the node radio coverage. Experimental results show that the method is simple and effectively improve the prediction accuracy of the sensor node radio coverage.