TO GET THIS PROJECT COMPLETE SOURCE ON SUPPORT WITH EXECUTION PLEASE CALL BELOW CONTACT DETAILS
MOBILE: 9791938249, 0413-2211159, WEB: WWW.NEXGENPROJECT.COM,WWW.FINALYEAR-IEEEPROJECTS.COM, EMAIL:Praveen@nexgenproject.com
NEXGEN TECHNOLOGY provides total software solutions to its customers. Apsys works closely with the customers to identify their business processes for computerization and help them implement state-of-the-art solutions. By identifying and enhancing their processes through information technology solutions. NEXGEN TECHNOLOGY help it customers optimally use their resources.
MINIMIZING RADIO RESOURCE USAGE FOR MACHINE-TO-MACHINE COMMUNICATIONS THROUGH DATA-CENTRIC CLUSTERING
1. CONTACT: PRAVEEN KUMAR. L (, +91 – 9791938249)
MAIL ID: sunsid1989@gmail.com, praveen@nexgenproject.com
Web: www.nexgenproject.com, www.finalyear-ieeeprojects.com
MINIMIZING RADIO RESOURCE USAGE FOR MACHINE-TO-MACHINE
COMMUNICATIONS THROUGH DATA-CENTRIC CLUSTERING
ABSTRACT:
While clustered communication has been considered as one key technology
for wireless sensor networks, existing work on cluster formation
predominantly takes a pure graphtheoretic approach with the goal of
optimizing the performance of individual machines. Since the radio resource
available for M2M communications is typically limited yet the amount of data
to transport is large, such “resource-agnostic” and “data-agnostic” clustering
techniques could lead to sub-optimal performance. To address this problem,
we propose “data-centric” clustering in a resource-constrained M2M network
by prioritizing the quality of overall data over the performance of individual
machines. We first formulate an optimization problem to minimize the
amount of radio resource needed for supporting two-tier clustered
communications. We then partition the formulated problem into the inner
power control and outer cluster formation sub-problems and propose
algorithms for solving the problems. While power control can be optimally
solved for any given cluster structure by the proposed algorithm, cluster
formation is an NP-hard problem. Hence, we propose an anytime, guided,
stochastic search algorithm to find a reasonably good cluster structure
without incurring prohibitive computation complexity. Compared with
2. CONTACT: PRAVEEN KUMAR. L (, +91 – 9791938249)
MAIL ID: sunsid1989@gmail.com, praveen@nexgenproject.com
Web: www.nexgenproject.com, www.finalyear-ieeeprojects.com
baseline approaches, our evaluation results show that data-centric clustering
can achieve noticeable performance gain by selecting only important
machines and forming a cluster structure that can balance the radio resource
usage of the two tiers. We therefore motivate data-centric clustering as a
promising communication model for resource-constrained M2M networks.
CONCLUSIONS
In this work, we have presented data-centric clustering for data gathering in
resource-constrained M2M networks. We have formulated an MINLP problem
for forming a two-tier cluster structure with the objective of minimizing the
total radio resource usage under the fidelity requirement for data gathering.
The formulated problem involves joint optimization of cluster formation and
power control, and hence we have divided it into two sub-problems and then
proposed two algorithms involving iterative power update and cluster
structure search to solve the two sub-problems respectively. While the inner
power control sub-problem can be solved optimally for any given cluster
structure, the outer cluster formation sub-problem is NP-hard. Hence, we have
proposed an anytime, guided, stochastic search algorithm to find a reasonably
good cluster structure without incurring prohibitive computation complexity.
Evaluation results against no clustering and baseline clustering approaches
have shown that datacentric clustering is effective in terms of radio resource
reduction and transmission energy savings. The promising results motivate
further investigation on protocol implementation for data-centric clustering in
M2M wireless networks.
3. CONTACT: PRAVEEN KUMAR. L (, +91 – 9791938249)
MAIL ID: sunsid1989@gmail.com, praveen@nexgenproject.com
Web: www.nexgenproject.com, www.finalyear-ieeeprojects.com
REFERENCES
*1+ 3GPP, “System improvements for machine-type communications (MTC),”
TR-23.888, v11.0.0, Sep. 2012.
[2] ——, “Study on RAN improvements for machine-type communications
(MTC),” TR-37.868, v11.0.0, Sep. 2011.
[3] L. Zhou and H.-C. Chao, “Multimedia traffic security architecture for the
Internet of things,” IEEE Network, vol. 25, no. 3, pp. 35–40, May-June 2011.
*4+ A. Amis, R. Prakash, T. Vuong, and D. Huynh, “Max-min d-cluster formation
in wireless ad hoc networks,” in Proceedings of IEEE INFOCOM, Mar. 2000, pp.
32–41.
*5+ P. Wang, R. Dai, and I. Akyildiz, “Visual correlation-based image gathering
for wireless multimedia sensor networks,” in Proceedings of IEEE INFOCOM,
Apr. 2011, pp. 2489–2497.
*6+ M. Lotfinezhad, B. Liang, and E. Sousa, “Adaptive cluster-based data
collection in sensor networks with direct sink access,” IEEE Trans. on Mobile
Computing, vol. 7, no. 7, pp. 884–897, 2008.
[7] R. Verdone, F. Fabbri, and C. Buratti, “Maximizing area throughput in
clustered wireless sensor networks,” IEEE Journal on Selected Areas in
Communications, vol. 28, no. 7, pp. 1200–1210, 2010.
4. CONTACT: PRAVEEN KUMAR. L (, +91 – 9791938249)
MAIL ID: sunsid1989@gmail.com, praveen@nexgenproject.com
Web: www.nexgenproject.com, www.finalyear-ieeeprojects.com
[8] S.-Y. Lien, K.-C. Chen, and Y. Lin, “Toward ubiquitous massive accesses in
3GPP machine-to-machine communications,” IEEE Communications Magazine,
vol. 49, no. 4, pp. 66–74, Apr. 2011.
[9] S.-E. Wei, H.-Y. Hsieh, and H.-J. Su, “Joint optimization of cluster formation
and power control for interference-limited machine-to-machine
communications,” in Proceedings of IEEE Global Telecommunications
Conference (Globecom), Dec. 2012, pp. 5512–5518.
*10+ O. Younis, M. Krunz, and S. Ramasubramanian, “Node clustering in
wireless sensor networks: recent developments and deployment challenges,”
IEEE Network, vol. 20, no. 3, pp. 20–25, 2006.