Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 30472

Select areas to restrict search in scientific publication database:
A Beacon Based Priority Routing Scheme for Solar Power Plants in WSNs
Solar power plants(SPPs) have shown a lot of good outcomes in providing a various functions depending on industrial expectations by deploying ad-hoc networking with helps of light loaded and battery powered sensor nodes. In particular, it is strongly requested to develop an algorithm to deriver the sensing data from the end node of solar power plants to the sink node on time. In this paper, based on the above observation we have proposed an IEEE802.15.4 based self routing scheme for solar power plants. The proposed beacon based priority routing Algorithm (BPRA) scheme utilizes beacon periods in sending message with embedding the high priority data and thus provides high quality of service(QoS) in the given criteria. The performance measures are the packet Throughput, delivery, latency, total energy consumption. Simulation results under TinyOS Simulator(TOSSIM) have shown the proposed scheme outcome the conventional Ad hoc On-Demand Distance Vector(AODV) Routing in solar power plants.
Digital Object Identifier (DOI):


[1] Ho-In Jeon, "WiBEEM: Optimal USN's architecture for U-City Core Services Implementation", The Institute of Electronics Engineers of Korea, 23(12), pp17-36, 2006.
[2] Dong-Sung Kim, Jung Il Lee, "Systematic Transmission Method of Industrial IEEE 802.15.4 for Real-time Mixed Traffic", The Institute of Electronics Engineers of Korea, 45(6), pp18-26,2008
[3] Hanback Electronics R&D Center INC., "Ubiquitous Sensor Network System: using Zigbex", Book Publishing ITC, p60-73, 2006.
[4] J.Zheng, M.Lee, " A Comprehensive performance study of IEEE802.15.4", Sensor Network Operations, IEEE Press, Wiley Interscience, Chapter 4, pp.218-237, 2006.
[5] P.Baronti, P.Pillai, V.Chook, S.Chessa, A.Gotta, Y.Hu, "Wireless sensor networks: A survey on the state of the art and the 802.15.4 and ZigBee standards", Computer Communications In Wired/Wireless Internet Communications, Vol.30, No.7, pp1655-1695, 2007.
[6] V.P.Rao, D.Marandin, "Adaptive Backoff Exponent Algorithm for Zigbee(IEEE802.15.4)", Lecture Notes in Computer Science, Vol4003, pp501-516, 2006.
[7] Myeong-Yu Kim, Ki-Hyung Kim, "CSMA-CA Backoff Algorithm for Consideration of traffic situation in IEEE 802.15.4", The Institute of Electronics Engineers of Korea, Summer Conference, pp1366-1367, 2009
[8] Woon-Geun Kwak, Jai-Yong Lee, " Cyclic Contention Free Access Scheme for IEEE802.15.4 WPAN ",The Institute of Electronics Engineers of Korea, Vol.32, No.7, p455-462,2007.
[9] ZigBee Alliance, ZigBee Specification, 2008.
[10] A.Koubaa, M.Alves, E.Tovar, "GTS Allocation Analysis in IEEE 802.15.4 for Real-Time Wireless Sensor Networks", IPP-Hurray Technical report TR-060404, 2006.
[11] W.Qiu, E.Skafidas, P.Hao, "Enhanced tree routing for wireless sensor networks", Ad Hoc Networks,No.7,p638-650,2009.
[12] C.Perkins, E.Royer, "Ad-hoc On-Demand Distance Vector Routing", Proceedings of Second IEEE Workshop Mobile Computing Systems and Applications, p90-100,1999.
[13] P.Levis, N.Lee, "TOSSIM: A Simulator for TinyOS Networks", 2003.
[14] J.Nielsen, "Zipf Curves and Website Popularity",
[15] D.Gay, P.Levis, R.Behren, M.Welsh, E.Brewer, and D.Culler, "The nesC Language: A Holistic Approach to Networked Embedded Systems", PLDI, 2003.
[16] H. Perros, "Computer Simulation Techniques: The definitive introduction!", North Carolina State University,, 2003.
[17] Y.-M. Yang and S. Kim, "An improved self routing scheme by using parent-child relationship and beacon-only period for WSNs", IJICT, Vol. 2, pp. 279-301, 2010.
[18] Geoff Kirby, "Zipf-s LAW", UK Journal of Naval Science, Vol. 10, No. 3 pp. 180-185, 1985
Vol:14 No:06 2020Vol:14 No:05 2020Vol:14 No:04 2020Vol:14 No:03 2020Vol:14 No:02 2020Vol:14 No:01 2020
Vol:13 No:12 2019Vol:13 No:11 2019Vol:13 No:10 2019Vol:13 No:09 2019Vol:13 No:08 2019Vol:13 No:07 2019Vol:13 No:06 2019Vol:13 No:05 2019Vol:13 No:04 2019Vol:13 No:03 2019Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007