Please use this identifier to cite or link to this item:
http://hdl.handle.net/2080/852
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chinara, S | - |
dc.contributor.author | Rath, S K | - |
dc.date.accessioned | 2009-05-19T06:17:06Z | - |
dc.date.available | 2009-05-19T06:17:06Z | - |
dc.date.issued | 2008 | - |
dc.identifier.citation | International Conference on Information Technology, Bhubaneswar, ICIT, December 17-20, 2008. | en |
dc.identifier.uri | http://dx.doi.org/10.1109/ICIT.2008.54 | - |
dc.identifier.uri | http://hdl.handle.net/2080/852 | - |
dc.description.abstract | The mapping of cellular architecture into mobile ad hoc network (MANET) leads to the design of Linked Cluster Architecture (LCA), where every cluster has a head node associated with zero or more member nodes. In order to achieve a faster cluster setup, we consider mobility of nodes as the deciding parameter for selecting the heads and their associated members. A node having the lowest mobility among its neighbors becomes the cluster head. Selection of low mobile nodes as the cluster heads ensures better cluster stability. A new energy consumption model has been considered for the cluster heads that takes into account the network traffic, density of cluster members and the transmission power utilized to communicate the member nodes. | en |
dc.format.extent | 308495 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | IEEE | en |
dc.subject | ad hoc networks | en |
dc.subject | cellular radio | en |
dc.subject | energy consumption | en |
dc.subject | telecommunication traffic | en |
dc.title | Mobility Based Clustering Algorithm and the Energy Consumption Model of Dynamic Nodes in Mobile Ad Hoc Network | en |
dc.type | Article | en |
Appears in Collections: | Conference Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
mobility.pdf | 301.26 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.