i-manager Publications

Analysis of Energy Maps and Time Delay for Mobile Wireless Networks based on Path Integration Algorithm

SHEIK NAGOOR VALI*, R.Srinivasa Raju**

* PG Scholar, Department of Computer Science and Engineering,Vishnu Institute of Technology, Bhimavaram, India.

** Associate Professor, Department of Computer Science and Engineering, Vishnu Institute of Technology, Bhimavaram, India.

Periodicity:December - February'2014
DOI : https://doi.org/10.26634/jcom.1.4.2712

Abstract

The authors show that the mobile networks are highly un-predictable when viewed at the individual node scale, and the end-to-end Quality-of-Service (QOS) metrics can be stationary when the mobile network is viewed in the aggregate. Finally, they show how energy maps can be utilized by an application that aims to minimize a node's total energy consumption over its near-future trajectory. And also they have to determine whether the data will be reached on the destination within the time stamp or that would not be calculated.

Keywords

End-to-End Quality of Service(QoS), Energy, Maps, Time Delay, Random Way Point(RWP), Scalable Energyefficient Asynchronous Dissemination(SEAD), Two-Tier Data Dissemination (TTDD)

How to Cite this Article?

Vali, S.K.N., and Raju, R.S. (2014). Analysis of Energy Maps and Time Delay for Mobile Wireless Networks Based on Path Integration Algorithm. i-manager’s Journal on Computer Science, 1(4), 1-8. https://doi.org/10.26634/jcom.1.4.2712

References

[1].D. Niculescu and B. Nath (2003), “Trajectory Based Forwarding and Its Applications,” Proc. ACM Mobi Com,.

[2]. M.K. Park and V. Rodoplu (2007), “Energy Maps for Large-Scale, Mobile Wireless Networks,” Proc. Int'l Comm. Conf. (ICC '07), pp. 3136- 3141, June.

[3]. S. Chakrabarti and A. Mishra (2001), “QoS Issues in Ad Hoc Wireless Networks,” IEEE Comm. Magazine, pp. 142- 148, Feb.

[4]. C. Bettstetter, G. Resta, and P. Santi (2003), “The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks,” IEEE Trans. Mobile Computing, Vol. 2, No. 3, pp. 257-269, July-Sept.

[5]. W. Navidi and T. Camp (2004), “Stationary Distributions for the Random Waypoint Model,” IEEE Trans. Mobile Computing, Vol. 3, No. 1,pp. 99-108, Jan.-Mar.

[6]. B. Liang and Z.J. Haas (2003), “Predictive Distance- Based Mobility Management for Multidimensional PCS Networks,” IEEE/ACM Trans. Networking, Vol. 11, No. 5, pp. 718-732, Oct.

[7]. G.S. Malkin and M.E. Steenstrup (1995), “Distance- Vector Routing”. Prentice Hall.

[8]. J. Moy (1995), Link-State Routing. Prentice Hall

[9]. C.E. Perkins and P. Bhagwat (1994), “Highly Dynamic Destination- Sequenced Distance-Vector (DSDV) for Mobile Computers,” Proc. ACM SIGCOMM, Vol. 24, No. 4, pp. 234-244, Oct.

[10]. T. Clausen, P. Jacquet, A. Laouiti, P. Muhlethaler, A. Qayyum, and L. Viennot (2001), “Optimized Link State Routing Protocol,” Proc. IEEE Int'l Multitopic Conf. (INMIC '01), Dec.

[11]. B. Bellur, R.G. Ogier, and F.L. Templin (2001), “Topology Broadcast Based on Reverse-Path Forwarding (TBRPF),” IETF Internet Draft, Mar.

[12]. C.E. Perkins and E.M. Royer (1999), “Ad-Hoc On- Demand Distance Vector Routing,” Proc. IEEE Workshop Mobile Computing Systems and Applications, pp. 90- 100, Feb.

[13]. D.B. Johnson and D.A. Maltz (1996), “Dynamic Source Routing in Ad Hoc Wireless Networks,” Mobile Computing, pp. 153-181.

If you have access to this article please login to view the article or kindly login to purchase the article

Single Article

	North Americas,UK, Middle East,Europe		India	Rest of world
	USD	EUR	INR	USD-ROW
Online	15	15

ADD TO CART

Options for accessing this content:

If you would like institutional access to this content, please recommend the title to your librarian.
If you already have i-manager's user account: Login above and proceed to purchase the article.
New Users: Please register, then proceed to purchase the article.