Impact Factor:6.549
 Scopus Suggested Journal: Tracking ID for this title suggestion is: 55EC484EE39417F0

International Journal
of Computer Engineering in Research Trends (IJCERT)

Scholarly, Peer-Reviewed, Platinum Open Access and Multidisciplinary




Welcome to IJCERT

International Journal of Computer Engineering in Research Trends. Scholarly, Peer-Reviewed, Platinum Open Access and Multidisciplinary

ISSN(Online):2349-7084                 Submit Paper    Check Paper Status    Conference Proposal

Back to Current Issues

Mobile Transmission Using Rigorous Data for Wireless Sensor Networks

K.MANIMALA, B.RANJITH, , ,
Affiliations
M.Tech Research Scholar, Priyadarshini Institute of Technology and Science for Women
HOD-CSE, Priyadarshini Institute of Technology and Science for Women
:NOT ASSIGNED


Abstract
Wireless Sensor Networks (WSNs) are progressively more used in data-intensive applications such as micro-climate monitor, exactitude agriculture, and audio/video supervision. A key dispute faced by data-intensive WSNs is to convey all the data generated within an application's duration to the base station regardless of the fact that antenna nodes have restricted power supplies. We recommend using low-cost not reusable mobile transmissions to concentrate the energy expenditure of data-intensive WSNs. Our advance differs from preceding work in two main aspects. First, it does not require complex motion planning of mobile nodes, so it can be implemented on a number of low-cost mobile sensor platforms. Second, we incorporate the energy exploitation due to both mobility and wireless transmissions into a holistic optimization framework. Our framework consists of three main algorithms. The first algorithm computes an optimal routing tree pretentious no nodes can move. The second algorithm improves the topology of the routing tree by tightfistedly adding new nodes exploiting mobility of the newly added nodes. The third algorithm improves the routing tree by relocating its nodes without changing its topology. This iterative algorithm converges on the optimal position for each node given the restriction that the routing tree topology does not change. We present professional distributed implementations for each algorithm that require only inadequate, confined to a small area bringing together. Because we do not automatically calculate an optimal topology, our ending routing tree is not automatically optimal. However, our simulation results show that our algorithms significantly surpass the best presented solutions.


Citation
K.MANIMALA,B.RANJITH."Mobile Transmission Using Rigorous Data for Wireless Sensor Networks". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 06,pp.436-446, DECEMBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I614.pdf,


Keywords : Wireless sensor networks, energy optimization, mobile nodes, wireless steering

References
[1] R. Szewczyk, A. Mainwaring, J. Polastre, J.
Anderson, and
D. Culler, “An analysis of a large scale habitat
monitoring application,” in SenSys, 2004.
[2] L. Luo, Q. Cao, C. Huang, T. F. Abdelzaher, J.
A. Stankovic, and M. Ward, “Enviromic: Towards
cooperative storage and retrieval in audio sensor
networks,” in ICDCS, 2007, p. 34.
[3] D. Ganesan, B. Greenstein, D. Perelyubskiy,
D. Estrin, and
J. Heidemann, “An evaluation of multi-resolution
storage for sensor networks,” in SenSys, 2003.
[4] S. R. Gandham, M. Dawande, R. Prakash, and S.
Venkatesan, “Energy efficient schemes for wireless
sensor networks with multiple mobile base
stations,” in Globecom, 2003.
[5] J. Luo and J.-P. Hubaux, “Joint mobility and
routing for life-time elongation in wireless sensor
networks,” in INFOCOM, 2005.
[6] Z. M. Wang, S. Basagni, E. Melachrinoudis, and
C. Petrioli, “Exploiting sink mobility for maximizing
sensor networks lifetime,” in HICSS, 2005.
[7] A. Kansal, D. D. Jea, D. Estrin, and M. B.
Srivastava, “Con-trollably mobile infrastructure for
low energy embedded net-works,” IEEE
Transactions on Mobile Computing, vol. 5, pp. 958–
973, 2006.
[8] G. Xing, T. Wang, W. Jia, and M. Li,
“Rendezvous design algorithms for wireless sensor
networks with a mobile base station,” in MobiHoc,
2008, pp. 231–240.
[9] D. Jea, A. A. Somasundara, and M. B.
Srivastava, “Multiple controlled mobile elements
(data mules) for data collection in sensor networks,”
in DCOSS, 2005.
[10] R. Shah, S. Roy, S. Jain, and W. Brunette, “Data
mules: Modeling a three-tier architecture for sparse
sensor networks,” in IEEE SNPA Workshop, 2003.
[11] S. Jain, R. Shah, W. Brunette, G. Borriello, and S.
Roy, “Exploiting mobility for energy efficient data
collection in wireless sensor networks,” MONET,
vol. 11, pp. 327–339, 2006.
[12] W. Wang, V. Srinivasan, and K.-C. Chua,
“Using mobile re-lays to prolong the lifetime of
wireless sensor networks,” in MobiCom, 2005.
[13] D. K. Goldenberg, J. Lin, and A. S. Morse,
“Towards mobility as a network control primitive,”
in MobiHoc, 2004, pp. 163–174.
[14] A. A. Somasundara, A. Ramamoorthy, and M.
B. Srivastava, “Mobile element scheduling with
dynamic deadlines,” IEEE Transactions on Mobile
Computing, vol. 6, pp. 395–410, 2007.
[15] Y. Gu, D. Bozdag, and E. Ekici, “Mobile element
based differentiated message delivery in wireless
sensor networks,” in
[16] K. Dantu, M. Rahimi, H. Shah, S. Babel, A.
Dhariwal, and G. S. Sukhatme, “Robomote:
enabling mobility in sensor networks,” in IPSN,
2005.
[17] http://www.kteam.com/robots/khepera/index.html.
[18] J.-H. Kim, D.-H. Kim, Y.-J. Kim and K.-T. Seow,
Soccer Robotics. Springer, 2004.
[19] G. Xing, T. Wang, Z. Xie, and W. Jia,
“Rendezvous planning in wireless sensor networks
with mobile elements,” IEEE Transactions on
Mobile Computing, vol. 7, pp. 1430–1443, 2008.
[20] “Rendezvous planning in mobility-assisted
wireless sensor networks,” in RTSS ’07: Proceedings
of the 28th IEEE Inter-national Real-Time Systems
Symposium, 2007, pp. 311–320. 


DOI Link : NOT ASSIGNED

Download :
  V1I614.pdf


Refbacks : Currently there are no Refbacks

Support Us


We have kept IJCERT is a free peer-reviewed scientific journal to endorse conservation. We have not put up a paywall to readers, and we do not charge for publishing. But running a monthly journal costs is a lot. While we do have some associates, we still need support to keep the journal flourishing. If our readers help fund it, our future will be more secure.

Quick Links



DOI:10.22362/ijcert


Science Central

Score: 13.30





Submit your paper to editorijcert@gmail.com