Abstracto

Sleep Scheduling Technique for Geographic Routing in MANET

Asha L Nair, Dr S.Perumal Sankar

MANETs are collections of wireless nodes that can dynamically establish a network at any time at any place without using any fixed infrastructure. Due to dynamically changing topology routing in such network is very difficult. Traditional routing algorithms like distance vector and link state consumes more energy and less scalable. So we go for location based routing algorithms. Geographic routing is one of the most promising routing schemes in wireless sensor networks (WSNs), due to its simplicity, scalability, and efficiency. Unlike topological routing algorithms, they do not need to exchange and maintain routing information and work nearly stateless. This makes geographic routing attractive for wireless ad hoc and sensor networks. Most geographic routing algorithms use a greedy strategy that tries to approach the destination in each step. Even though they are scalable and simple energy consumption is very high. Here we introduce one new algorithm called GDBN sleep scheduling algorithm to reduce energy consumption. And compare the energy consumption with the normal geographic routing.