On the optimal number of chargers in battery-less wirelessly powered sensor networks

Author(s):  
Dimitrios Zorbas ◽  
Patrice Raveneau ◽  
Yacine Ghamri-Doudane ◽  
Christos Douligeris
2017 ◽  
Vol 13 (1) ◽  
pp. 155014771668484 ◽  
Author(s):  
Huthiafa Q Qadori ◽  
Zuriati A Zulkarnain ◽  
Zurina Mohd Hanapi ◽  
Shamala Subramaniam

Recently, wireless sensor networks have employed the concept of mobile agent to reduce energy consumption and obtain effective data gathering. Typically, in data gathering based on mobile agent, it is an important and essential step to find out the optimal itinerary planning for the mobile agent. However, single-agent itinerary planning suffers from two primary disadvantages: task delay and large size of mobile agent as the scale of the network is expanded. Thus, using multi-agent itinerary planning overcomes the drawbacks of single-agent itinerary planning. Despite the advantages of multi-agent itinerary planning, finding the optimal number of distributed mobile agents, source nodes grouping, and optimal itinerary of each mobile agent for simultaneous data gathering are still regarded as critical issues in wireless sensor network. Therefore, in this article, the existing algorithms that have been identified in the literature to address the above issues are reviewed. The review shows that most of the algorithms used one parameter to find the optimal number of mobile agents in multi-agent itinerary planning without utilizing other parameters. More importantly, the review showed that theses algorithms did not take into account the security of the data gathered by the mobile agent. Accordingly, we indicated the limitations of each proposed algorithm and new directions are provided for future research.


2012 ◽  
pp. 944-966
Author(s):  
Laxminarayana S. Pillutla ◽  
Vikram Krishnamurthy

This chapter considers the problem of data gathering in correlated wireless sensor networks with distributed source coding (DSC), and virtual multiple input and multiple output (MIMO) based cooperative transmission. Using the concepts of super and sub modularity on a lattice, we analytically quantify as how the optimal constellation size, and optimal number of cooperating nodes, vary with respect to the correlation coefficient. In particular, we show that the optimal constellation size is an increasing function of the correlation coefficient. For the virtual MIMO transmission case, the optimal number of cooperating nodes is a decreasing function of the correlation coefficient. We also prove that in a virtual MIMO based transmission scheme, the optimal constellation size adopted by each cooperating node is a decreasing function of number of cooperating nodes. Also it is shown that, the optimal number of cooperating nodes is a decreasing function of the constellation size adopted by each cooperating node. We also study numerically that for short distance ranges, SISO transmission achieves better energy-mutual information (MI) tradeoff. However, for medium and large distance ranges, the virtual MIMO transmission achieves better energy-MI tradeoff.


2014 ◽  
Vol 666 ◽  
pp. 322-326
Author(s):  
Yu Yang Peng ◽  
Jae Ho Choi

Energy efficiency is one of the important hot issues in wireless sensor networks. In this paper, a multi-hop scheme based on a cooperative multi-input multi-outputspatial modulation technique is proposed in order to improve energy efficiency in WSN. In this scheme, the sensor nodes are grouped into clusters in order to achieve a multi-input multi-output system; and a simple forwarding transmission scenario is considered so that the intermediate clusters only forward packets originated from the source cluster down to the sink cluster. In order to verify the performance of the proposed system, the bit energy consumption formula is derived and the optimal number of hopsis determined. By qualitative experiments, the obtained results show that the proposed scheme can deliver the data over multiple hops consuming optimal energy consumption per bit.


2014 ◽  
Vol 614 ◽  
pp. 472-475 ◽  
Author(s):  
Jin Gang Cao

Due to limited energy, computing ability, and memory of Wireless sensor Networks(WSN), routing issue is one of the key factors for WSN. LEACH is the first clustering routing protocol, which can efficiently reduce the energy consumption and prolong the lifetime of WSN, but it also has some disadvantage. This paper proposed an improvement based LEACH, called LEACH-T. According to different number of clusters, LEACH-T uses variable time slot for different clusters in steady-state phase, and single-hop or multi-hop to transmit data between cluster heads and Base Station. Also it considered residual energy of sensor nodes and the optimal number of clusters during selection of the cluster heads. The simulation results show that LEACH-T has better performance than LEACH for prolonging the lifetime and reducing the energy consumption.


Sign in / Sign up

Export Citation Format

Share Document