An Aggregator Deployment Protocol for Energy Conservation in Wireless Sensor Networks

Fan, Zuzhi; Chen, Y.P.; Zhou, Huaibei

doi:10.1109/icnsc.2008.4525366

Cited by 2 publications

(11 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The rest of this paper is organized as follows: In Section II, related work on data collection via mobile elements in WSNs is reviewed. In Section III, we give the problem definition and review proposed scheme in our prior work [9]. Section IV discusses an adaptive deployment protocol and implementation details.…”

Section: Bsmentioning

confidence: 99%

“…The other kinds of mobility scheme execute in a "move and sojourn" strategy where mobile elements deploy themselves first and then collect sensed information via spanning routing tree [8], [9], [14], [15]. Finding the optimized deployment position for mobile elements and the appropriate routing path for sensors are the key issues to assure energy efficiency of network.…”

Section: Related Workmentioning

confidence: 99%

“…In this section, we first introduce some assumptions and notations in Table II, then bring forward the assumed network model and formulate the problem. Next, we give a skeleton of ADPEC [9], which is a centralized deployment algorithm for energy conservation based on artificial potential-field theory.…”

Section: Aggregator Deployment Algorithm For Energy Conservationmentioning

confidence: 99%

“…In fact, each sensor will select the nearest MA to join and the network is formed as Voronoi diagram ( Figure 2). Since MAs is much fewer compared to sensors, nodes faraway from cluster centre have to communicate with MAs by dedicated multi-hop routing algorithm, such as CDPR [9]. Inevitably, the "funneling effect" will bring the uneven energy dissipation among the sensor nodes.…”

Section: A Network Model and Problem Formulationmentioning

confidence: 99%

“…Intuitively, it is possible to balance the load of sensor nodes if BSs or cluster-heads change their position from time to time, which is analytically proved by [8] and our prior work [9]. In this paper, we consider a heterogeneous network which consists of a few mobile aggregators with sufficient power supply and large number of resourceconstrained static sensors [10].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Mobility-assisted Hierarchy for Efficient Data Collection in Wireless Sensor Networks

Fan¹,

Chen²

2010

JCM

Self Cite

View full text Add to dashboard Cite

One fundamental task of wireless sensor networks (WSNs) is to collect useful information from the sensory field or response users query. In such scenario, the gigantic amount of individual sensor readings will converge to the base station (BS) of the network. Thus, the “funnelling effect” which describes the convergence of data traffic towards data sinks remains a major threat to the network lifetime. In particular, those sensors near data sinks need to relay data for nodes that farther away and burn energy faster with the result that the network may become disconnected or dysfunctional. In this paper, we investigate a heterogeneous sensor network by introducing a few mobile elements1, referred as aggregators into static sensor network and utilize the mobility to alleviate the ”funnelling effect”. In particular, these aggregators deploy themselves and worked as cluster heads. In such mobility-assisted hierarchy, we study the aggregator deployment problem for energy conservation and consider the integration of mobility and routing algorithms for lifetime elongation. Based on the extensive simulation, we show that such mobility-based hierarchy can significantly mitigate the ”funnelling effect” and then prolong network lifetime.

show abstract

Section: Bsmentioning

confidence: 99%