2011 IEEE Symposium on Computers & Informatics

Energy Efficient cross-layer design protocol by using token passing mechanism for WSN
SandhyaSree Thaskani MS by Research(ECE) IIIT-Hyderabad Hyderabad, India thaskanisandhya@gmail.com K.Vinod Kumar BE (EEE) NIT-Warangal Warangal, India vinodreddy.nitw@gmail.com G.Rama Murthy Associate Professor IIIT-Hyderabad Hyderabad, India rammurthy@iiit.ac.in

Abstract Recent advancements in processor, memory and radio technologies have enabled cheap and small sensors which are capable of sensing, communication and computation. Most of the Wireless Sensor Networks have limitation of battery power and in most of the applications it is not possible to replace the battery of a node. Considering this scarce energy and processing resources of WSN, we try to establish a joint optimization and design of networking layers i.e., cross layer design which could be a promising alternative to the inefficient traditional layered protocol design. In this paper we propose energy efficient cross layer design of the MAC and Routing protocol namely Energy Efficient cross-layer design protocol by using token passing mechanism for WSN. This proposed protocol proves to be better than some of the existing protocols and it is shown with the help of simulations. Keywords Wireless Sensor Network, Token Passing, Level, Sector, Sectroid,

Routing is a very important function carried out by network layer in the protocol stack. The routing layer protocols mainly emphasize on energy efficiency and throughput. Routing algorithms are broadly divided as data centric, hierarchical, fault tolerant, localization based [1]. In this proposed algorithm we make use of a innovative localization scheme proposed by [2] to reduce the redundancy. In [2] authors have localized by dividing the sensor field into levels and sectors. Using this localization technique combined with Token passing approach we propose a new approach Energy Efficient cross-layer design protocol by using token passing mechanism for WSN which proves to be better than many existing protocols for static WSN. II. RELATED WORK The previous scientific and experimental research reveals that the interactions between layers of the network stack play a very important role in improving the performance of the network. The inter dependency between the local contention and end to end congestion is an important factor to be considered in the protocol design. The interdependency between these network layers need cross layer mechanisms for efficient data delivery in WSNs. The design challenges and the importance of the cross layer design for meeting the application requirements in the energy constrained networks is discussed in [4]. Receiver based routing has been discussed in [5], the authors dealt with energy efficiency, time delay, multi hop and single hop performance. In [6] a TDMA based MAC scheduling routing algorithm is proposed where authors made use of sleep schedules which minimize the wastage of idle listening. Also the nodes will transmit in a particular time slot which is chosen based on the topology information. In this algorithm in addition to MAC scheduling, the route establishment is also dealt. The physical layer results in [7] are extended in [8] to compute the TDMA slot lengths to minimize the total energy consumption in a network with many transmitters and only one receiver. Some protocols are designed based on the type of applications and other factors. For example, in [9] for periodic traffic in WSN, the nodes form distributed on-off schedules for each flow in network. This forms a route and max

I. INTRODUCTION Recent advancements in electronics and wireless communications enabled the manufacturing of cheap and small sensor nodes. A Wireless Sensor Network (WSN) consists of numerous sensor motes which sense the data, communicate with each other hop by hop and eventually report the data to the Base Station. Though WSN started for military applications, gradually it found to have very useful applications in wide range of areas like Health, Building Monitoring, Factory Automation etc. The main constraint in protocol design for WSN is Energy Efficiency as the motes have limitations due to battery operation. In many of the applications the sensor nodes are unattended and so battery replacement is not at all possible. Researchers have designed numerous protocols for each layer in the traditional layered protocol design. But by joint optimization of multiple layers by cross layer design gives more satisfactory results than our traditional layered design. Medium Access Control (MAC) Protocols in Wireless Communications are broadly classified into three categories namely scheduled based, demand based and contention based MAC Protocols. TDMA, FDMA and CDMA are scheduled based MAC Protocols. Traditional methods like Trunking, Polling comes under demand based protocols. IEEE 802.11 standards define contention based protocols CSMA/CA. Token Ring is a combination of both contention based and scheduled based protocols.

978-1-61284-691-0/11/$26.00 2011 IEEE

572

efficiency could be achieved. The authors also showed a trade off between on-off schedules and the connectivity in the network. III. ASSUMPTIONS & DEFINITIONS 1. 2. 3. 4. 5. Our first assumption is that all the sensors in the network are Topology Aware. The whole sensor network is densely deployed. All nodes in network have equal capabilities. Time synchronization for all nodes is done automatically. Token Frame (TC): This is a control packet that circulates within group of nodes. It has number of fields which are as follows, Direction Flag (DF), Group Number (GN), Source Address (SA), Destination Address (DA), and Frame Control (FC). Fig. 1 shows the frame structure of token frame.
FC GN SA DA DF

IV. PROPOSED ALGORITHM The Proposed Algorithm is implemented in three main phases. They are as follows. 1. Sectroid (Group) Formation 2. Token Passing 3. Routing 1. Sectroid (Group) Formation:

Token Frame Packet Frame

FC

LID

SID

SA

DATA

Acknowledgement frame Panic Message FC

FC

GN

DA

SA

Our basic assumption is that BS has capability of transmitting signals at various power levels. During the initial deployment the base station sends with minimum power level. All the sensor nodes which receive this broadcast message set their level id as 1. Then the Base Station steps up the power to the next higher value and broadcasts the signals. Now the nodes which receive the message for the first time will set their level id to 2. Like this the Base Station keeps on increasing the power of transmitting signal till all the nodes in the network are covered. After levelling is completed the base station calculates the signal strength required for the broadcast to be heard by the farthest node in the network. Using this signal strength and a directional antenna which has a steerable beam, the sensor network is divided into equiangular sectors in clockwise or anti-clockwise direction. When the WSN is divided the base station sends some control packets using which all the nodes assign their sector ids. 2. Token Passing: Every sectroid in the sensor network is assumed to be a group. In a group each node has two neighbours, left neighbour and right neighbour. Each group has two edge nodes, left edge node and right edge node. Left edge nodes left neighbour is set to zero and right edge nodes right neighbour is set to zero.A token is passed among all the nodes in a group and a node can transmit its data only when it holds the token. This actually avoids lots of collisions as at any point of time only a single node (from the whole group) is allowed to transmit the data.

GN

SA

Fig. 1 Frame structure in our protocol

Acknowledgement (ACK): It is a control packet sent by a node to the adjacent node as a confirmation for the token packet reception. Fig. 1 shows the frame structure of acknowledgement. 7. Panic Message: It is a control message that is passed to the neighbours by a dying node. Fig. 1 shows the frame structure of panic message. 8. Packet Frame: This frame contains the data. This frame gives Level Id (LID), Sector Id (SID), source address (SA) and data (DATA). Fig. 1 shows the frame structure of packet frame. 9. Network Lifetime: The time taken for 10% of the total number of nodes in the network to fail is considered to be the Network Lifetime. 10. Direction Flag: This flag determines the direction of flow of the token. When the DF is set to be 0, the token is given to the left neighbour. If it is set to 1 then it is passed to the right neighbour, else if it is set to value 2 currently the node is not holding the token.

6.

Fig. 2 Part of sensor field divided into sectroids (groups)

573

Initially a token is initialised by the left m nodes of all the most groups in the whole network. If the Directio Flag (DF) is set on to 0 then the token must be passed on to th left neighbour in he the group else to the right neighbour in th group. Since the he token is initialized in the right most node, the DF is set be 0. The first node holds the token for a fixed am mount of time Hold Time (TH) which is lesser than the transmis ssion time (TX). So that we can make sure that a node hold ding the token can complete the transmission completely. Aft this Hold Time ter the token is passed on to the next neighbo ouring node (left or right depending on the status of DF). When the token reaches n the edge nodes i.e., the right most or the lef most nodes, they ft invert the status of the DF and start passin the token again. ng Since there is always a chance that the to oken frame may be lost due to several reasons, we also give an acknowledgement n packet for every token pass. If any node d doesnt get back a token acknowledgement then it reinitializes the token with the s same attributes which it stores tempora arily in the cache memory. 1. 2. 3.

Fig. 4 Schematic of the Proposed Algorithm e

When a node receives a data packet, it checks the s level and sector id of th packet. he If the level id from th source is lesser than nodes he level then the packet is dropped. s If the level id from the source is larger than the node, e then it checks wheth the sector id is from the her neighbouring sectors i.e., sectors with one hop distance. If not the packet is dropped.

Fig. 3 Schematic of Token Passing Pro ocedure

In case of node failure, that is when the energy of a node reaches certain threshold value then it s sends out a panic message to both its neighbours. The neigh hbours will exclude the node from the chain of token passing and they make each other as their right and left neighbours. T Typically when the edge node is about to die, there after the n neighbouring node itself becomes an edge node. 3. Routing:

V. SIMULATION EVALUATION N In this section, we compare our proposed algorithm with traditional levelling [3] and P PASCAL [2] algorithms. We calculate the network life time a number of average number and of redundant messages receive by base station using each ed algorithm. All implementation of protocols are done in n MATLAB. Table I shows node parameters considered for this simulation study. All simulati ion results in this paper are average values after repeating 10 experimentations. A. Experimental Methodology red all nodes are distributed In this paper we consider randomly in a flat ground. In case of MAC for Levelling and PASCAL, we considered simp MAC protocol CSMA/CA. ple For simplicity error free links ar considered. re
TABLE I RAMETERS NODE PAR

Whenever a sensor node gets a packet, i will see that it is it forwarded only if it is from a higher leve This makes the el. flow of data only towards the base station not away from it. n This is also considered as Directional Flood ding. The packet is forwarded only when it is coming from th adjacent sectors. he This make the flow of data converge as we move towards the e base station. Effectively the levelling and clustering decreases redundancy to a great extent. The schem matic flow of the algorithm can be seen as follows.

Parameters Simulation Area Number of Nodes Initial Energy Node Transmission Range Transmission Power Reception Power

Values 200 X 200 m2 200 to 700 500 J 60m 10 J 2J

574

algorithm is lesser than tradit tional levelling and PASCAL algorithms.

Fig. 5 Network Life Time

Fig. 5 shows the plot of Network Lifetim and Number of me nodes comparing our proposed algorithm with traditional m leveling and PASCAL. The graphs show that the proposed algorithm gives better network lifetime than leveling protocol n and flooding. The network life time is defi ined as the number of events taken for the failure of 10% of n nodes in the whole sensor network. Fig. 6 shows the plot of average redund dant messages and number of nodes comparing our algorithm with traditional m levelling and PASCAL. The graph shows that the proposed algorithms have less number of redundan messages when nt compared to levelling and PASCAL protoco ols. Experimental results shows that our prop posed algorithm has better energy efficiency as the network life t time is better when compared to levelling and PASCAL and a average number of redundant message are lesser than levell ling and PASCAL protocols. VI. CONCLUSIONS In this paper, we have proposed a tok passing based ken cross-layer mechanism to serve the purpo oses of both MAC and routing layers. Total network is hierarch hically formed into groups. Each group have a token. A node w token can only with transmit data. After every TH time token is passed to its next s neighbour. All the nodes in a group are equ ually given change to transmit its data. By passing a lig ght weight packet scheduling is done. By doing directional f flooding routing is accomplished. Experimental results have proven that o proposed crossour layer mechanism have better energy efficiency when compared to traditional levelling and PA ASCAL algorithms. Average number of redundant messages in our proposed s

Fig.6 Average number o Redundant Messages of

REFERE ENCES
[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

Ian.F.Akyildiz, Weilian Su, Y Yogesh Sankarasubramaniam, and Erdal Gayirci, A Survey on Sensor Networks,IEEE y Communications Magazine, A August 2002. ] Md.Aquil Mirza, Ramamur rthy Garimella, PASCAL: Power Aware Sectoring Based Cl lustering Algorithm for Wireless Sensor Networks, The International Conference on ICOIN), Chiang Mai, Thailand. Information Networking (I January 20-24th,2009. R. L. Cruz and A. V. San nthanam, Optimal routing, link scheduling and power control in multi-hop wireless networks, IEEE INFOCOM, 2003. A. J. Goldsmith and S. W. Wicker, Design challenges for wireless networks, IEEE Wireless energy-constrained ad hoc w Communications Magazine, 2 . 2002 P. Skraba, H. Aghajan, A. Ba ahai, Cross-layer optimization for high density sensor networ rks: Distributed passive routing Decisions, in Proc. Ad-Hoc Now04, Vancouver, July 2004. L. van Hoesel, T. Nieberg, J. Wu, and P. J. M. Havinga, , Prolonging the lifetime of w wireless sensor networks by crosslayer interaction, IEEE Wire eless Communications, vol. 11, no. 6, pp. 78 - 86, Dec. 2004. S. Cui, A. J. Goldsmith, an A. Bahai, Energy-constrained nd modulation optimization, I IEEE Transactions on Wireless Communications, vol. 4, no. 5 pp. 23492360. 5, S. Cui, A. J. Goldsmith, and A. Bahai, Joint modulation and d multiple access optimizati ion under energy constraints, GLOBECOM, 2004.
M. L. Sichitiu, Cross-layer scheduling for power efficiency in wireless sensor networks, 2004.

[9]

575