Modeling Hidden Nodes Collisions in Wireless Sensor Networks: Analysis Approach

This paper studied both types of collisions. In this paper, we show that advocated solutions for coping with hidden node collisions are unsuitable for sensor networks. We model both types of collisions and derive closed-form formula giving the probability of hidden and visible node collisions. To reduce these collisions, we propose two solutions. The first one based on tuning the carrier sense threshold saves a substantial amount of collisions by reducing the number of hidden nodes. The second one based on adjusting the contention window size is complementary to the first one. It reduces the probability of overlapping transmissions, which reduces both collisions due to hidden and visible nodes. We validate and evaluate the performance of these solutions through simulations

Topology Control Algorithm considering Antenna Radiation Pattern in Three-Dimensional Wireless Sensor Networks

Topology control is a key issue of wireless sensor network to reduce energy consumption and communication collision. Topology control algorithms in three-dimensional space have been proposed by modifying existing two-dimensional algorithms. These algorithms are based on the theoretical assumption that transmission power is radiated equally to the all directions by using isotropic antenna model. However, isotropic antenna does not exist, which is hypothetical antenna to compare the real antenna performance. In the real network, dipole antenna is applied, and because of the radiation pattern, performance of topology control algorithm is degraded. We proposed local remapping algorithm to solve the problem and applied it to existing topology control algorithms. Simulation results show that our algorithm increases performance of existing algorithms and reduces power consumption

Efficient Energy Transport in 60 Ghz for Wireless Industrial Sensor Networks

Radio-frequency (RF) energy transport is a viable technology to power small-sized sensors in Wireless Industrial Sensor Networks (WISN). 60 GHz wireless communication is the leading technology for next generation wireless networks and a potential technology to build WISNs. In this article, we focus on the efficiency of RF energy transport in WISNs with 60 GHz communications. We also present an antenna sphere with the supported analytics of the directional antenna in 60 GHz wireless communication. We describe and solve the spherical distribution problem of the directional antenna to maximize the efficiency of energy transport in the WISNs. Based on our extensive simulations, the antenna distribution performs better than other solutions in given WISN environment

Using artificial intelligence in routing schemes for wireless networks

For the latest 10 years, many authors have focused their investigations in wireless sensor networks. Different researching issues have been extensively developed: power consumption, MAC protocols, self-organizing network algorithms, data-aggregation schemes, routing protocols, QoS management, etc. Due to the constraints on data processing and power consumption, the use of artificial intelligence has been historically discarded. However, in some special scenarios the features of neural networks are appropriate to develop complex tasks such as path discovery. In this paper, we explore the performance of two very well-known routing paradigms, directed diffusion and Energy-Aware Routing, and our routing algorithm, named SIR, which has the novelty of being based on the introduction of neural networks in every sensor node. Extensive simulations over our wireless sensor network simulator, OLIMPO, have been carried out to study the efficiency of the introduction of neural networks. A comparison of the results obtained with every routing protocol is analyzed. This paper attempts to encourage the use of artificial intelligence techniques in wireless sensor nodes

The Optimal Sleep Control for Wireless Sensor Networks

[[abstract]]The sensor node in Wireless Sensor Network is with the characteristics of low power consumption, but the sensor node can't be rechargeable. Therefore, the consumed of power is limited. How to effectively control the power of the sensor node and extend the life time of the whole network become a very important issue. This paper sets forth "The Optimal Sleep Control For Wireless Sensor Networks ". When the sensor nodes are set randomly in the entire network and the sleeping probability is determined through the distance between the sensor node and the sink. This method will effectively reduce the frequency of the transmission of the sensor nodes more close to the sink and reach the loading balance of the whole network. However, the sleeping sensor nodes will process their sleeping schedule according to their own residual power and achieve the effectiveness of saving power.[[sponsorship]]IEEE Taipei Section; National Science Council; Ministry of Education; Tamkang University; Asia University; Providence University; The University of Aizu; Lanzhou University[[conferencetype]]國內[[conferencetkucampus]]淡水校園[[conferencedate]]20091203~20091205[[booktype]]紙本[[iscallforpapers]]Y[[conferencelocation]]Taipei, Taiwa

Energy efficient clustered chain based power aware routing protocol for wireless sensor networks

WSNs has emerged as am important computing platform in the recent few years. Wireless Sensor Networks consists of a large number of sensor nodes, which are operated by a small battery. Sensor nodes can be deployed in the harsh environment. Once they are deployed, it becomes impossible to replace or recharge its battery. So the battery power of sensor node should be used efficiently. Many routing protocols has been proposed so far but they has not taken consideration of critical data. So we propose EECCPAR protocol which considers time critical data by using MAX threshold concept. Our protocol is better than PEGASIS protocol, this has been shown by simulation results

Topology Control in Heterogeneous Wireless Networks: Problems and Solutions

Previous work on topology control usually assumes homogeneous wireless nodes with uniform transmission ranges. In this paper, we propose two localized topology control algorithms for heterogeneous wireless multi-hop networks with nonuniform transmission ranges: Directed Relative Neighborhood Graph (DRNG) and Directed Local Spanning Subgraph (DLSS). In both algorithms, each node selects a set of neighbors based on the locally collected information. We prove that (1) the topologies derived under DRNG and DLSS preserve the network connectivity; (2) the out degree of any node in the resulting topology by DLSS is bounded, while the out degree cannot be bounded in DRNG; and (3) the topologies generated by DRNG and DLSS preserve the network bi-directionality