NDLI: A cost minimization algorithm for mobile data gathering in wireless sensor networks

Content Provider	IEEE Xplore Digital Library
Author	Miao Zhao Dawei Gong Yuanyuan Yang
Copyright Year	2010
Description	Author affiliation: Department of Electrical and Computer Engineering, Stony Brook University, Stony Brook, NY 11794, USA (Miao Zhao; Dawei Gong; Yuanyuan Yang)
Abstract	Recent studies have shown that significant benefit can be achieved in wireless sensor networks (WSNs) by employing mobile collectors for data gathering via short-range communications. A typical scenario for such a scheme is that a mobile collector roams over the sensing field and pauses at some anchor points on its moving tour such that it can traverse the transmission range of all the sensors in the field and directly collect data from each sensor. In this paper, we study the performance optimization of such mobile data gathering by formulating it into a cost minimization problem constrained by the channel capacity, the minimum amount of data gathered from each sensor and the bound of total sojourn time at all anchor points. We assume that the cost of a sensor for a particular anchor point is a function of the data amount a sensor uploads to the mobile collector during its sojourn time at this anchor point. In order to provide an efficient and distributed algorithm, we decompose this global optimization problem into two subproblems to be solved by each sensor and the mobile collector, respectively. We show that such decomposition can be characterized as a pricing mechanism, in which each sensor independently adjusts its payment for the data uploading opportunity to the mobile collector based on the shadow prices of different anchor points. Correspondingly, we give an efficient algorithm to jointly solve the two subproblems. Our theoretical analysis demonstrates that the proposed algorithm can achieve the optimal data control for each sensor and the optimal sojourn time allocation for the mobile collector, which minimizes the overall network cost. Finally, extensive simulation results further validate that our algorithm achieves lower cost than the compared data gathering strategy.
Starting Page	322
Ending Page	331
File Size	436244
Page Count	10
File Format	PDF
ISBN	9781424474882
ISSN	21556806
e-ISBN	9781424474905
DOI	10.1109/MASS.2010.5664020
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-11-08
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Wireless sensor networks convex problem Sensor phenomena and characterization Mobile data gathering Mobile communication Minimization Routing Sensor systems decomposition duality Karush-Kuhn-Tucker (KKT) conditions
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Network Cost Minimization for Mobile Data Gathering in Wireless Sensor Networks

A distributed optimal framework for mobile data gathering with concurrent data uploading in wireless sensor networks

Optimality conditions and duality for a class of nondifferentiable multiobjective generalized fractional programming problems

Multi-objective geometric programming problem with Karush−Kuhn−Tucker condition using ϵ-constraint method

Routing and flow rate assignment using multi-objective optimization in wireless sensor networks

Multi-Item Inventory Lot-Size Model with Increasing Varying Holding Cost : A Karush-Kuhn-Tucker Conditions Approach

Duality and the “convex” karush-kuhn-tucker theorem (2008).

A 2-Approximation Double-Tree Algorithm for Correlated Data Gathering in Wireless Sensor Networks

Bounded relay hop mobile data gathering in wireless sensor networks

A cost minimization algorithm for mobile data gathering in wireless sensor networks

Similar Documents

Network Cost Minimization for Mobile Data Gathering in Wireless Sensor Networks

A distributed optimal framework for mobile data gathering with concurrent data uploading in wireless sensor networks

Optimality conditions and duality for a class of nondifferentiable multiobjective generalized fractional programming problems

Multi-objective geometric programming problem with Karush−Kuhn−Tucker condition using ϵ-constraint method

Routing and flow rate assignment using multi-objective optimization in wireless sensor networks

Multi-Item Inventory Lot-Size Model with Increasing Varying Holding Cost : A Karush-Kuhn-Tucker Conditions Approach

Duality and the “convex” karush-kuhn-tucker theorem (2008).

A 2-Approximation Double-Tree Algorithm for Correlated Data Gathering in Wireless Sensor Networks

Bounded relay hop mobile data gathering in wireless sensor networks

A cost minimization algorithm for mobile data gathering in wireless sensor networks