Generalized Bitmap Routing Protocol for Wireless Sensor Network

This paper proposes a generalized bitmap routing protocol, which finds the efficient routing path by minimizing the network. Jung in proposed a bitmap routing protocol for sensor networks. His routing protocol uses a bitmap table to represent the connection information between nodes. However, it has a problem that the table size is depends on the number of nodes. This problem is very serious especially in the sensor network composed with the nodes of limited memory. Thereby, this paper proposes a generalized bitmap routing protocol to solve the problem in Jung´s protocol. Proposed protocol could optimize the size of bitmap table by applying the deployed network property. Proposed protocol could be used in the diversity of sensor networks due to it could be optimized in the different size of networks with the memory restricted sensor nodes.