Routing Protocol Based on Hypercube in Sensor Network

Elham Mazinan Department of computer Arak branch, Islamic Azad University Arak, Iran e-mazinan@iau-arak.ac.ir
AbstractRouting protocols play an important role for communications in MANET. Multi path routing scheme can be distinguished because it can provide load balancing, faulttolerance, and higher aggregate bandwidth. Routing protocols for wireless sensor networks are responsible for maintaining the routes in the network and have to ensure reliable multi-hop communication under these conditions. In this paper, a novel routing protocol based on hypercube is proposed. It can highlight good performance in data transfer rate and query efficiency. Based on this structure, the routing can be Fault Tolerant and Scalable. Keywords Sensor Network, Routing protocols, hypercube

Mehdi Khazaeyan, Mohsen Rostamy Malkhalifeh Department of Mathematic Sience &Reserches branch, Islamic Azad University Tehran,Iran Khazaeyan@gmail.com mohsen-rostamy@yahoo.com
Routing protocol [4] is a protocol that specifies how routers (sensor nodes) communicate with each other, disseminating information that enables them to select routes between any two nodes on the network, the choice of the route being done by routing algorithms. Each router has a priori knowledge only of the networks attached to it directly. A routing protocol shares this information first among immediate neighbors, and then throughout the network. This way, routers gain knowledge of the topology of the network. In case of wireless sensor networks dynamic routing is employed because nodes may frequently change their position and die at any moment. WSNs have several restrictions, e.g., limited energy supply, limited computing power, and limited bandwidth of the wireless links connecting sensor nodes. One of the main design goals of WSNs is to carry out data communication while trying to prolong the lifetime of the network and prevent connectivity degradation by employing aggressive energy management techniques. The design of routing protocols in WSNs is influenced by many challenging factors. These factors must be overcome before efficient communication can be achieved in WSNs. In the following, we summarize some of the routing challenges and design issues that affect routing process in WSNs. Node deployment: Node deployment in WSNs is application dependent and affects the performance of the routing protocol. Data Reporting Model: Data sensing and reporting in WSNs is dependent on the application and the time criticality of the data reporting. Node/Link Heterogeneity: In many studies, all sensor nodes were assumed to be homogeneous, i.e., having equal capacity in terms of computation, communication, and power. However, depending on the application a sensor node can have different role or capability.

I.

INTRODUCTION

A WSN typically consists of a large number of low-cost, low-power, and multifunctional wireless sensor nodes, with sensing, wireless communications and computation capabilities [1, 2]. These sensor nodes communicate over short distance via a wireless medium and collaborate to accomplish a common task, for example, environment monitoring, military surveillance, and industrial process control [3]. The basic philosophy behind WSNs is that, while the capability of each individual sensor node is limited, the aggregate power of the entire network is sufficient for the required mission. The sensor nodes must be able to autonomously organize themselves into a wireless communication network. Sensor nodes are battery-powered and are expected to operate without attendance for a relatively long period of time. WSNs are characterized with denser levels of sensor node deployment, higher unreliability of sensor nodes, and sever power, computation, and memory constraints. The topology of the sensor network changes very frequently. Nodes may not have global identification. Since the distance between the sensor nodes and base station in case of direct communication is large, they consume energy quickly. A

Fault Tolerance: Some sensor nodes may fail or be blocked due to lack of power, physical damage, or environmental interference. The failure of sensor nodes should not affect the overall task of the sensor network. Scalability: The number of sensor nodes deployed in the sensing area may be in the order of hundreds or thousands, or more. Any routing scheme must be able to work with this huge number of sensor nodes Connectivity: High node density in sensor networks precludes them from being completely isolated from each other. Therefore, sensor nodes are expected to be highly connected. Coverage: In WSNs, each sensor node obtains a certain view of the environment. A given sensor's view of the environment is limited both in range and in accuracy. It can only cover a limited physical area of the environment. Hence, area coverage is also an important design parameter in WSNs. II. ROUTING PROTOCOLS IN WSNS

Routing in wireless sensor networks differs from conventional routing in fixed networks in various ways. There is no infrastructure, wireless links are unreliable, sensor nodes may fail, and routing protocols have to meet strict energy saving requirements [5]. Many routing algorithms were developed for wireless networks in general. All major routing protocols proposed for WSNs may be divided into seven categories as shown in fig.1.

Fig.1 all major routing protocols proposed for WSNs In location-based protocols, sensor nodes are addressed by means of their locations. Location information for sensor nodes is required for sensor networks by most of the routing protocols to calculate the distance between two particular nodes so that energy consumption can be estimated. In this section, we present a sample of location-aware routing protocols proposed for WSNs. for example GAF [6] and GEAR [7] and Span [8, 9] and TBF [10] are in locationbased protocols group. Data-centric protocols differ from traditional address-centric protocols in the manner that the data is sent from source sensors to the sink. In address-centric protocols, each source sensor that has the appropriate data responds by sending its

data to the sink independently of all other sensors. However, in data-centric protocols, when the source sensors send their data to the sink, intermediate sensors can perform some form of aggregation on the data originating from multiple source sensors and send the aggregated data toward the sink. This process can result in energy savings because of less transmission required to send the data from the sources to the sink. For example SPIN [11, 12] and Directed diffusion [13, 14] and cougar [15] are in Data-centric protocols group. Many research projects in the last few years have explored hierarchical clustering in WSN from different perspectives. Clustering is an energy-efficient communication protocol that can be used by the sensors to report their sensed data to the sink. In this section, we describe a sample of layered protocols in which a network is composed of several clumps (or clusters) of sensors. Each clump is managed by a special node, called cluster head, which is responsible for coordinating the data transmission activities of all sensors in its clump. LEACH [16, 17] and PEGASIS [18] and HEED [19, 20] are in Hierarchical Protocols group. Mobility brings new challenges to routing protocols in WSNs. Sink mobility requires energy efficient protocols to guarantee data delivery originated from source sensors toward mobile sinks. SEAD [21] and Dynamic Proxy TreeBased Data Dissemination [22] are in Mobility-based Protocols group. Considering data transmission between source sensors and the sink, there are two routing Paradigms: Single path routing and multi path routing. In single path routing, each source sensor sends its data to the sink via the shortest path. In multi path routing, each source sensor finds the first k shortest paths to the sink and divides its load evenly among these paths. Disjoint Paths [23] and Braided Paths [24] and N-to-1 Multi path Discovery [25] are in Multi path-based Protocols group. In heterogeneity sensor network architecture, there are two types of sensors namely line-powered sensors which have no energy constraint, and the battery powered sensors having limited lifetime, and hence should use their available energy efficiently by minimizing their potential of data communication and computation. Using heterogeneity in WSNs extend network lifetime and present a few routing protocols. IDSQ [26] and CHR routing protocol [27] are in Heterogeneity-based Protocols group. In addition to minimizing energy consumption, it is also important to consider quality of service (QoS) requirements in terms of delay, reliability, and fault tolerance in routing in WSNs. QoS based routing protocols help find a balance between energy consumption and QoS requirements. SAR and SPEED [28] are in QoS-based Protocols group. III. NEW PROTOCOL BASED ON HYPERCUBE

In this paper, a novel routing protocol based on hypercube is proposed. It can highlight good performance in data transfer rate and query efficiency. Based on this structure, the routing can be implemented efficiently. Hypercube is a well-known over layer structure and has been widely used in context

based search in the Internet community. Hypercube is a graph (V; E), where V is the set of vertices and E is the set of edges. The set of all v in d-dimensional space with each coordinate equal to zero or one. We consider a communication link for every two vertices differing in a single coordinate. Fig.2 shows 2-dimensional cube and 3dimensional cube and 4-dimensional cube. For making 1dimensional cube, combine two 0-dimensional cubes and add 1 to the most left bit of one cube and 0 to the most left bit of other cube. For making 2-dimensional cube, combine two 1dimensional cubes and add 1 to the most left bit of one cube and 0 to the most left bit of other cube then for making ddimensional cube we can combine two (d-1)-dimensional cubes as showed in fig.2.

for(l=1;l<=d;l++) printf("%2d",source[l]); printf("\t"); } if(source[k+i]==0) source[k+i]=1; else source[k+i]=0; for(l=1;l<=d;l++) printf("%2d",source[l]); printf("\t"); printf("\n");

Fig.3 Algorithm for finding several dependent paths between source and destination This algorithm finds several independent paths between source and destination. One of Challenges and Design Issues in WSNs is Fault Tolerance. Some sensor nodes may fail or be blocked due to lack of power, physical damage, or environmental interference. The failure of sensor nodes should not affect the overall task of the sensor network. If many nodes fail, MAC and routing protocols must accommodate formation of new links and routes to the data collection base stations. This may require actively adjusting transmit powers and signaling rates on the existing links to reduce energy consumption, or rerouting packets through regions of the network where more energy is available. Therefore, multiple levels of redundancy may be needed in a fault-tolerant sensor network. In this algorithm, if one node in a path failed we can select other path and send data because all the paths are independent and they have not any share node. Therefore, we have a fault-tolerant sensor network. Other Challenge and Design Issue in WSNs is scalability. The number of sensor nodes deployed in the sensing area may be in the order of hundreds or thousands, or more. Any routing scheme must be able to work with this huge number of sensor nodes. In addition, sensor network routing protocols should be scalable enough to respond to events in the environment. Until an event occurs, most of the sensors can remain in the sleep state, with data from the few remaining sensors providing a coarse quality. Protocol based on hypercube is scalable because we can combine two (d-1)dimensional cubes and make a d-dimensional cube. Therefore, if number of sensor nodes increased we can make bigger size of hypercube. In this algorithm, for simplifying, assumed source and destination differ in the k first bits. As showed in Fig.3 this algorithm makes k paths having k links and d-k paths having k+2 links. K paths having k links is contracted as followed: For the (i)Th path, started with the identity of source reversed sequentionally bits i through k then reversed seqentionally bits 1 through i-1. D-k paths having k+2 links is contracted as followed: For the ith path, started with the identity of source reversed (k+i)Th bit then reversed sequentionally bits 1 through k and reversed again the (k+i)Th bit. For example, source identity is 00100 and destination identity is 11100. As showed in fig.4 there is 2 independent paths with 2 links and 3 independent paths with 4 links. These paths are independent and have not any share vertices.

Fig.2 numbering in 2-D cube and 3-D cube and 4-D cube In this numbering each related vertices differ in one bit then for sending data between two related vertices, we just start from one related vertex and change one bit of it then we will have other related vertex. For sending data between source and destination we use an algorithm [30] that shown in fig.3.
#include<stdio.h> #include<conio.h> int main() {int x,d,source[10],source2[10],destination[10],k=0,i,l,j; clrscr(); printf("enter dimention of HyperCube (d):\n");scanf("%d",&d); printf("enter source:\n"); for(x=1;x<=d;x++) {scanf("%d",&source[x]);source2[x]=source[x];} printf("enter destination:\n"); for(x=1;x<=d;x++) {scanf("%d",&destination[x]);} for(x=1;x<=d;x++) if (source[x]!=destination[x]) k++; printf("source and destination differ in %d bits\n",k); printf("There is %d independent paths of %d links and %d independent paths of %d links\n\n",k,k,d-k,k+2); printf( "******%d independent paths of %d links:*****\n",k,k); for(i=1;i<=k;i++) {printf("Path No: %d \n",i); for(j=0;j<10;j++) source[j]=source2[j]; for(j=1;j<=d;j++) printf("%2d",source[j]); printf("\t"); for(x=i;x<=k;x++) { if(source[x]==0) source[x]=1; else source[x]=0; for(l=1;l<=d;l++) printf("%2d",source[l]); printf("\t");} for(x=1;x<=i-1;x++) { if(source[x]==0) source[x]=1; else source[x]=0; for(l=1;l<=d;l++) printf("%2d",source[l]); printf("\t"); } printf("\n"); } printf("\n"); printf("*****%d independent paths of %d links:*****\n",d-k,k+2); for(i=1;i<=d-k;i++) { printf("Path No: %d \n",i); for(j=0;j<10;j++) source[j]=source2[j]; for(j=1;j<=d;j++) printf("%2d",source[j]); printf("\t"); if(source[k+i]==0) source[k+i]=1; else source[k+i]=0; for(l=1;l<=d;l++) printf("%2d",source[l]); printf("\t"); for(x=1;x<=k;x++) { if(source[x]==0) source[x]=1; else source[x]=0;

Fig.4 there are 2 independent paths with 2 links and 3 independent paths with 4 links between is 00100 and 11100 IV. CONCLUSION

This paper focus on the new protocol based on hypercube in wireless sensor networks. We discussed about Routing Challenges and Design Issues in WSNs. One of the important routing challenges is Fault Tolerance. New protocol based on hypercube finds several independent paths between source and destination, if one node in one path failed we can select other path and send data because all the paths are independent and they have not any share node then this protocol is fault tolerance. Other advantage of new protocol is Scalability. This scheme can be able to work with huge number of sensor nodes because we can combine two (d-1)-dimensional cubes and make a d-dimensional cube. It can highlight good performance in data transfer rate and query efficiency. Based on this structure, the routing can be implemented efficiently. V. REFERENCES

[1] S.K. Singh, M.P. Singh, and D.K. Singh, A survey of Energy-Efficient Hierarchical Cluster-based Routing in Wireless Sensor Networks, International Journal of Advanced Networking and Application (IJANA), Sept.Oct. 2010, vol. 02, issue 02, pp. 570580. [2] S.K. Singh, M.P. Singh, and D.K. Singh, "Energy-efficient Homogeneous Clustering Algorithm for Wireless Sensor Network", International Journal of Wireless & Mobile Networks (IJWMN), Aug. 2010, vol. 2, no. 3, pp. 49-61. [3] Y. Yao and J. Gehrke, \The cougar approach to in-network query processing in sensor networks", in SIGMOD Record, September 2002. [4] C. Schurgers and M.B. Srivastava, \Energy efficient routing in wireless sensor networks", in the MILCOM Proceedings on Communications for Network-Centric Operations: Creating the Information Force, McLean, VA, 2001. 7. [5] S. Misra et al. (eds.), 5. Guide to Wireless Sensor Networks, Computer Communications and Networks, DOI: 10.1007/978-1-84882-218-4 4, Springer-Verlag London Limited 2009. [6] Y. X: u, J. Heidemann, and D. Estrin, "Geography-informed energy conservation for adhoc routing", Proceedings ACM/IEEE MobiCom'01, Rome, Italy, July 2001, pp. 70 -84. [7] Y. Yu, R. Govindan, and D. Estrin, "Geographical and energy aware routing: A recursive data dissemination protocol for wireless sensor networks", Technical Report UCLA/CSD-TR-01-0023, UCLA Computer Science Department, May 2001. [8] B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, "Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks", Proceedings ACM MobiCom'01, Rome, Italy, July 2001, pp. 85-96. [9] B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, "Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks", Wireless Networks, vol. 8, no.5, Sept. 2002, pp. 481494.

[10] B. Nath and D. Niculescu, "Routing on a curve", ACM SIGCOMM Computer Communication Review, vol. 33, no.1, Jan. 2003, pp. 155-160. [11] W. R. Heinzelman, J. Kulik, and H. Balakrishnan, "Adaptive protocols for information dissemination in wireless sensor networks", Proceedings ACM MobiCom '99, Seattle, WA, Aug.1999, pp. 174-185. [12] J. Kulik, W. Heinzelman, and H. Balakrishnan, "Negotiation-based protocols for disseminating information in wireless sensor networks", Wireless Networks, vol. 8, no. 2/3, Mar.-May 2002, pp. 169-185. [13] C. Intanagonwiwat, R. Govindan, and D. Estrin, "Directed diffusion: A scalable and robustcommunication paradigm for sensor networks", Proceedings ACM MobiCom'00, Boston, MA, Aug.2000, pp. 56-67. [14] C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, and F. Silva, "Directed diffusion forwireless sensor networking", IEEE/ACM Transactions on Networking, vol.11., no. 1, Feb. 2003. [15] Y. Yao and J. Gehrke, "The Cougar approach to in-network query processing in sensor networks", SGIMOD Record, vol. 31, no. 3, Sept. 2002, pp. 9-18. [16] W.R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, Energyefficient Communication Protocol for Wireless Microsensor Networks, in IEEE Computer Society Proceedings of the Thirty Third Hawaii International Conference on System Sciences (HICSS '00), Washington, DC, USA, Jan. 2000, vol. 8, pp. 8020. [17] W.R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, An Application-Specific Protocol Architecture for Wireless Microsensor Networks in IEEE Tmnsactions on Wireless Communications (October 2002), vol. 1(4), pp. 660-670. [18] S. Lindsey and C.S. Raghavendra, PEGASIS: Power-efficient Gathering in Sensor Information System, Proceedings IEEE Aerospace Conference, vol. 3, Big Sky, MT, Mar. 2002, pp. 1125-1130. [19] Ossama Younis and Sonia Fahmy, Distributed Clustering in Ad-hoc Sensor Networks: A Hybrid, Energy-efficient Approach, September 2002. [20] Ossama Younis and Sonia Fahmy Heed: A hybrid, Energy-efficient, Distributed Clustering Approach for Ad-hoc Networks, IEEE Transactions on Mobile Computing, vol. 3, no. 4, Oct.-Dec. 2004, pp. 366-369. [21] B. Karp and H. T. Kung, "GPSR: Greedy perimeter stateless routing for wireless networks", Proceedings ACM MobiCom'00, Boston, MA, Aug. 2000, pp. 243-254. [22] W. Chang, G. Cao, and T. La Porta, "Dynamic proxy tree-based data dissemination schemes for wireless sensor networks", Proceedings IEEE MASS'04, Fort Lauderdale, FL, Oct. 2004, pp. 21-30. [23] S. Lindsey, C. S. Raghavendra, and K. M. Sivalingam, "Data gathering in sensor networks using the energy delay metric", Proceedings IPDPS'01, San Francisco, CA, Apr. 2001, pp. 2001-2008. [24] S. Lindsey, C. S. Raghavendra, and K. M. Sivalingam, "Data gathering algorithms in sensor networks using energy metrics", IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 9, Sept. 2002, pp. 924-935. [25] M. Chu, H. Haussecker, and F. Zhao, "Scalable information-driven sensor querying and routing for ad hoc heterogeneous sensor networks", International Journal of High Performance Computing Applications, vol. 16, no. 3, Feb. 2002, pp. 293-313. [26] X. Du and F. Lin, "Improving routing in sensor networks with heterogeneous sensor nodes", Proceedings IEEE VTC'05, Dallas, TX, Sept. 2005, pp. 2528-2532. [27] I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, Wireless sensor networks: a survey, Computer Networks (Elsevier) Journal, Vol. 38, no. 4, Mar. 2002, pp. 393-422. [28] T. He et al., SPEED: A stateless protocol for real-time communication in sensor networks, in the Proceedings of International Conference on Distributed Computing Systems, Providence, RI, May 2003. [29] Shio Kumar Singh, M P Singh and D K Singh, Routing Protocols in Wireless Sensor Networks A Survey , International Journal of Computer Science & Engineering Survey (IJCSES) Vol.1, No.2, November 2010. [30] Michael J. Quinn, Designing Efficient Algorithms For Parallel Computers, University of New Hampshire.