Fermat Point Based Joint Routing in Dual-Aggregation-Points Inter-Backup M2M Communications

Article Preview

Abstract:

Machine-to-machine (M2M) communications can be widely used in military probing, disasters monitoring, etc., where have rigorous environment and require reliable communications. In order to provide enough reliability, M2M subnet can be deployed with two inter-backup aggregation points. This paper proposed a novel routing algorithm named Fermat Point based Joint Routing (FPJR) for such dual-aggregation-points inter-backup M2M Communications. Taking nodes on Fermat Points as route anchors, FPJR forms joint routes which can decrease energy cost and improve communication efficiency greatly. Further, considering the probability is quite little that there is exactly a node deployed on an appointed Fermat Point, we proposed a new terminology ‘ -Fermat Region’, which denotes the circle area with the Fermat Point as center and as radius. Based on -Fermat Region and through the FPJR interaction protocol, FPJR can act not only separately but also as the aid of other routing algorithms, without any compatibility problem. The simulation results show that FPJR can greatly decrease packet lost ratio, energy cost and packet delay.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 546-547)

Pages:

1205-1210

Citation:

Online since:

July 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Shao-Yu Lien, Kwang-Cheng Chen, Yonghua Lin. Toward Ubiquitous Massive Accesses in 3GPP Machine-to-Machine Communications. IEEE Communications Magazine, Vol. 49, pp.66-74, April (2011).

DOI: 10.1109/mcom.2011.5741148

Google Scholar

[2] XUE Jian-sheng, LIU Jian, REN Xiu-li, SONG Bao-yan, Research on Low Energy Consumption Wireless Sensor Network Routing Protocol, Computer Engineering, Vol. 36, No. 10, May (2010).

Google Scholar

[3] Kumar. V, Tiwari. S, Performance of Routing Protocols for Beacon-Enabled IEEE 802. 15. 4 WSNs with Different Duty Cycle, ICDECOM 2011, Mesra, India, pp.1-5, Feb. (2011).

DOI: 10.1109/icdecom.2011.5738549

Google Scholar

[4] Sung-Hee Lee, Young-Bae Ko, Geometry-driven Scheme for Geocast Routing in Mobile Ad Hoc Networks, Vehicular Technology Conference Fall 2006, Montréal, Québec, Canada, pp.638-642, Sept. (2006).

DOI: 10.1109/vetecs.2006.1682902

Google Scholar

[5] Jiann-Liang Chen, Ming-Chiao Chen, etc., Distributed Fermat-Point Location Estimation for Wireless Sensor Network Applications, IEEE Sarnoff Symposium 2007, Princeton, NJ, pp.1-5, Apr. (2007).

DOI: 10.1109/sarnof.2007.4567317

Google Scholar

[6] Kaushik Ghosh1, Sarbani Roy, An Alternative Approach to find the Fermat Point of a Polygonal Geographic Region for Energy Efficient, International Conference on Networks & Communications 2009, Chennai, India, pp.332-337, Dec. (2009).

DOI: 10.1109/netcom.2009.30

Google Scholar

[7] H. S. M. Coxeter, Introduction to Geometry, John Wiley & Sons, NY, 1961, pp.101-112.

Google Scholar

[8] H. Dorrie, 100 Great Problems Of Elementary Mathematics, Dover Publications, NY, 1965, pp.65-71.

Google Scholar

[9] H. S. M. Coxeter and S. L. Greitzer, Geometry Revisited, MAA, 1967, pp.35-42.

Google Scholar

[10] Perkins C.E., Royer E.M., Ad-hoc On-Demand Distance Vector Routing, IEEE Workshop on WMCSA '99, pp.90-100, Feb. (1999).

DOI: 10.1109/mcsa.1999.749281

Google Scholar

[11] Brad Karp, H. T. Kung. GPSR: Greedy Perimeter Stateless Routing for Wireless Networks. MobiCom (2000).

DOI: 10.21236/ada440078

Google Scholar