Title

Abstract: Typical wireless sensor networks (WSNs) comprise a lot of small,

lightweight sensor nodes to cover an area to collect data. These sensor nodes are
work on the power source Therefore the battery energy of sensor nodes has to be very
carefully and cleverly utilized. Additionally, it is also very important to balance the
energy consumption of the nodes so that the network stay connected and functional
for a long time. Wireless communications have become very pervasive over the time
period. WSNs have wide range of application such as traffic analysis, environmental
monitoring, industrial process monitoring, and tactical systems. In WSN, the data
packets are transmitted from source node to destination through several intermediate
nodes which forward data packets towards the next one hop neighbor. However, each
node participates simultaneously in several data transmissions. Each technique of
packet scheduling is used for improving the efficiency of the network based on certain
performance metrics and scheduling factor and every technique having some
limitations.

Keywords: Scheduling, Wireless Sensor Network, Deployment Strategy, Energy

Consumption, EDF, FCFS, Non-preemptive priority scheduling, preemptive priority
scheduling.
I. INTRODUCTION

A Wireless Sensor Network (WSN) consists of dense, small and low-cost wireless sensors
and memory sensor nodes, which are of two types: sensor node, and sink node or base
station (BS)[1]. A sensor node by itself has severe resource constraints, such as limited
battery energy supply, transmission radius and sensing capability. However, when a set
of sensor nodes co-operate with each other, they can efficiently perform a much bigger
task. The classification of the data packets scheduling should be based on set of factors:
the data delivery deadline, data priority, data type, and the no. of queues. A sensor node
may need to operate for long time depending on a small battery [2]. So, optimizing the
energy efficiency is very important for all sensor operations, which include sensing,
computation, and communication .The sensed data may be real time or non-real time. The
real-time data sense by the node should have higher priority as compared to non-real time
data packet. [1] In order to minimize the consumed energy, dropping packets should not
be only according to the deadline but also according to the packet energy consumption.
So, the scheduling needs to consider the queuing delay and packet energy consumption,
in order to achieve better network QoS and improve the WSN lifetime [3]. This reduces
the sensor node energy consumption. In FCFS scheduling scheme the data packets are
processed in order of their arrival time and therefore the data packet which is entering at
the last will require a long time to reach to a base station.
 II. Packet Scheduling in WSN

The classification of packet scheduling techniques is based on several factors such as:
deadline, packet type, priority and number of queues as shown in Figure 1[2] [4].

Figure 1: The classification of packet scheduling techniques

III. Proposed Methodology

This section presents the proposed system for comparative Performance analysis of Data
Delivery and packet priority scheduling schemes of wireless sensor network. Therefore,
there is no need to modify all of the transactions in packet scheduling schemes.
Methodology of the proposed system requires the following steps:

1) Network Initialization

In the network design, the number of nodes n is deployed either sequential or

randomly in the networks. The node which is in the center of the network is chosen as
the base station. And the communication range of the node is set to the area of 10*10
m2, where the nodes are divided into number of clusters with a cluster head ch.

All data packets at nodes should have limited lifetime, which are controlled by TTL
(time-to-live) information carried in the packet header or message format. Each
packet has time to live (TTL) which means basically the number of hops that a packet
travels to reach destination nodes where a hop is one portion of the path between
source and destination.
In our proposed system, base station (sink node) take the initiative to find dead node
in the Wireless Sensor Network. We assume that every node has a unique Node id,
every node has a neighbour table which store of its 1-hop neighbour nodes id. Sink
node send a Node_health_status_query(NHSQ) message to one of its neighbour node
choose randomly from neighbour table. If the node to which the
Node_health_status_query message is sent is alive it stores the message id and sender
 id in a query list table. Otherwise, the sender node waits for a certain time for reply
(ACK) message (Acknowledgment message) if it does not receive a reply within that
period it assumes that the selected neighbour is dead and it send that info to the sink
by selecting next hop of the path to sink from query list table. Figure 3.1 show NHSQ
message format and figure 3.2 ACK message format.

Message Id Message Type Destination Message SenderNodeId TTL

Figure 2: NHSQ message format

Message Id Message Type Destination Message SenderNodeId

Figure 0: ACK message format

2) Packet Scheduling

It is based on scheduling factor you need in certain Experiment such that you can choose
the scheme based on deadline or priority then the packets generated at source node will
be scheduled to being sent and delivered to destination based on chosen scheduling
scheme.

3) Performance Evaluation

Performance Evaluation is providing positive results on low average waiting time,

low Packet delay (end-to-end delay), low energy consumption and high throughput
and average packet delivery ratio during transmission. Comparison of results obtained
from all packet scheduling schemes will provide performance evaluation.

The proposed Performance analysis system of packet scheduling schemes of wireless

sensor network that consists of following steps: (1) Input network area of wireless sensor
network ,number of wireless sensor nodes, type of deployment, number of sink nodes or
clusters, packet scheduling factor and packet scheduling scheme based on previous factor,
(2) Build the wireless sensor network, (3) Record the position of each node using its x-
axis and y- axis in network area, (4) Determine the neighbors of each node, (5) Apply
clustering using LEACH protocol to determine cluster head (CH) nodes. (6) Generate
random number of messages using set of source nodes chosen by random selection, (7)
Send messages to destination nodes randomly chosen, (8) Record the messages
transactions for each node make sending or receiving process including details of message
such as source (sender), destination (receiver), message id, message type, , and number of
messages sent and received by each node included in transaction, (9) Calculate
performance metrics using the following equations [8]
 IV. Performance Metrics and Simulation

V. CONCLUSIONS

Using the concept of three-level priority queues at each node, the priority based
scheduling scheme allows different types of data packets to be processed based on their
priorities. Since real time and emergency data should be processed with the minimum
end-to-end delay, they are processed with the highest priority, and can pre-empt tasks with
lower priorities located in the two other queues. Moreover, in FCFS and multilevel queue
schedulers, the estimated processing time of a task is not considered when deciding the
priority of a task. Performance evaluation study is done on different types of deployment,
number of nodes, clusters, factors affecting scheduling scheme and different packet
scheduling technique to show the efficiency of the different packet scheduling schemes
on different circumstances. Since wireless sensor networks consume most energy for
communication, sensing and computing, various methods are used to improve
performance, conserve energy and extend network lifetime. In order to get the real
contribution of various methods we propose the benchmark methodology and
performance evaluation model. The implementation and simulation of the proposed
system is done using different node density using NetBeans and JSim that shows that the
running time is less than using other WSN simulators

REFERENCES
[1] C.-Y. Chong, S.P. Kumar, Sensor networks: evolution, opportunities, and
challenges, Proc. IEEE 91 (8) (2003) 12471256.
[2] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci,Asurvey on wireless
sensor networks, IEEE Common. Mag. 41 (8) (2003) 102114.
[3] G.J. Potties, W.J. Kaiser, Wireless integrated network sensors, Common. ACM
43 (5) (2001) 5158.
[4] J.M. Reason, J.M. Rabies, A study of energy consumption and reliability in a
multi-hop sensor network, ACM Mobile Computer. Common. Rev. 8 (1)
(2004).
[5] W. Ye, J. Heinemann, D. Estrin, An energy-efficient MAC protocol for
wireless sensor networks, in: Proceedings of the IEEE INFOCOM, vol. 3,
2003.
[6] T. van Dam, K. Langendoen, An adaptive energy-efficient MAC protocol for
wireless sensor networks, in: Proceedings of the ACM Conference on
Networked Sensor Systems, 2003, pp.
[7] M.L. Sichitiu, Cross-layer scheduling for power efficiency in wireless sensor
networks,in: Proceedings of the IEEE INFOCOM, 2004.
[8] C.-F. Hein, M. Liu, Network coverage using low duty-cycled sensors: random
and coordinated sleep algorithms in: Proceedings of the IPSN04, 2004, pp.
[9] A. Boukerche, X. Cheng, J. Linus, Energy-aware data-centric routing in
microsensor networks, in: Proceedings of the ACM MSWiM03, 2004, pp.
[10] U. Cetintemel, A. Flinders, Y. Sun, Power-efficient data dissemination in
wireless sensor networks, in: Proceedings of the ACMMobiDE03, 2003.
[11] W.B. Hein Zelman, A.P. Chandrakasan, H. BalaKrishnan, application specific
protocol architecture for wireless micro sensor networks, IEEE Trans.
Wireless Common. 1 (4) (2002).
[12] A. Manjeshwar, D. Agrawal, TEEN: a routing protocol for enhanced efficiency
in wireless sensor networks, in: Proceedings of the IEEE IPDPS 2001, pp.
20092012.
[13] S. Lindsey, C. Raghavendra, K.M. Siva lingam, Data gathering algorithms in
sensor networks using energy metrics, IEEE Trans. Parallel Diatribe. Syst. 13
(9) (2002).
[14] K. Du, J. Wu, D. Zhou, Chain-based protocols for data broadcasting and
gathering in the sensor networks, in: Proceedings of the International Parallel
Distributed Processing Sym., 2003.
[15] J. Aslam, Q. Li, D. Rus, Three power aware routing algorithms for sensor
networks, Wireless Common. Mobile computer. 2 (3) (2007).
[16] J.-H. Chang, L. Tassulas, Maximum lifetime routing in wireless sensor
networks, IEEE/ACM Trans. Network. 12 (4) (2006).
[17] G. Xing, C. Lu, Y. Zhang, Q. Huang, R. Pless, Minimum power configuration
in wireless sensor networks, in: Proceedings of the ACM Mob Hoc, 2004.
[18] P.Bonnet, J Gehrke, P Seshadri, Querying the physicalworld, IEEE personal
Commns.pp. 10-16, Oct 2000.
[19] Y. Yao, J. Gehrke, Query Processing for SensorNetworks, Proc. of CIDR, 2003
[20] J. Gehrke, S. Madden, Query Processing in SensorNetworks, Pervasive
Computing, pp. 46-56, Jan-Mar 2004.
[21] Y.Yao, J.Gehrke, The Cougar approach to in-networkquery processing in
sensor Networks, ACM SIGMOD 2003.
[22] A. Demers, J. Gehrke, R. Rajaraman, N. Trigoni and Y.Yao,The Cougar
Project: A Work In Progress Report,
Tech.Report, Cornell University, USA.
[23] N. Sadagopan, B. Krishnamari, A. Helmy, Active queryforwarding in sensor
Networks, Elsevier, Ad hoc Networks,2007.
[24] V. Rajendran, K.Obraczka, J.J. Garcia-Luna-Aceves,Energy-Efficient
CollisionFree Medium AccessControl for Wireless Sensor Networks, Proc. of
ACMSenSys, Nov 2002.
[25] LAN MAN Standards Committee of the IEEE ComputerSociety. IEEE Std
803.11- 1999, Wireless LAN MediumAccess Control (MAC) and Physical
Layer (PHY)specifications. IEEE,1998.
[26] W. Ye, J. Heidemann, D. Estrin, An Energy-EfficientMAC Protocol for
Wireless Sensor Networks," Proc. OfIEEE INFOCOM, June 2006.
[27] T. Van Dam, K. Langendoen, An Adaptive Energy-Efficient MAC Protocol for
Wireless Sensor Networks,"Proc. Of A CM SenSys ,Nov 2005.
[28] G. Lu, B. Krishnamachari, C. S. Raghavendra, AnAdaptive Energy-Efficient
and Low-Latency MAC for DataGathering in Sensor Networks," Proc. of WMAN,
2002.
[29] L Bajaj, M.Takai, R. Ahuja, K. Tang, R Bagrodia, M.Gerla, GloMoSim: A
Scalable Network-Simulation-
Environment, UCLA.Proceedings
[30] Yan Zhang, Shijue Zheng, Shaojun Xiong;A Scheduling Algorithm for TDMA-
based MAC Protocol in Wireless Sensor Networks 2009 First International
Workshop on Education Technology and Computer Science