Volume : IV, Issue : IV, April - 2014

Analysis and Improve Packet Delay Problem in Wireless Sensor Networks

Mr. G. Rajavarman

Abstract :

 An optimal network planning and protocol design to accelerate packet delivery in multi hop wireless networks but packet delay problem is lightly loaded large–scale multi hop wireless networks in terms of the packet propagation speed to avoid packet delay via reoadcasting packets. To achieve fastest information delivery in large–scale wireless networks, this is instrumental to the delay–minimization routing protocol design in wireless networks. Existing approach introduced unified speed upper bound for oadcast and unicast communications The speed upper bound found is  also applies to the wireless networks with arbitrary traffic loads and routing protocols since heavy load and non optimal path selection incur extra packet transportation delay. The tightness of the speed upper bound and packet delay is occurring. To overcome heavy load and packet delay problem using fastest packet Transmission Algorithm.  Design routing algorithm that identifies the next–hop relay nodes to achieve the fastest packet transmission. As this new algorithm assumes the knowledge of node locations, it is a variant of the geographic routing algorithms.

Keywords :

Article: Download PDF   DOI : 10.36106/ijar  

Cite This Article:

Mr.G.RAJAVARMAN Analysis and Improve Packet Delay Problem in Wireless Sensor Networks Indian Journal of Applied Research, Vol.IV, Issue. IV

Number of Downloads : 940

References :