Please use this identifier to cite or link to this item:
http://10.1.7.192:80/jspui/handle/123456789/2039
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Bagga, Prashant | - |
dc.contributor.author | Gajjar, Nagendra | - |
dc.date.accessioned | 2011-03-16T12:09:15Z | - |
dc.date.available | 2011-03-16T12:09:15Z | - |
dc.date.issued | 2006-11-01 | - |
dc.identifier.citation | Nirma University of Science and Technology, Ahmedabad, November 1, 2006 | en |
dc.identifier.uri | http://hdl.handle.net/123456789/2039 | - |
dc.description.abstract | Wireless Sensor Networks (WSNs) consist of small nodes with sensing, computation, and wireless communications capabilities. Many routing, power management, and data dissemination protocols have been specially designed for WSNs where energy awareness is an essential design issue. The focus, however, has been given to the routing protocols which might differ depending on the application and network architecture. In this paper, we present design challenges that are required to be fulfilled for routing techniques in WSNs. In this paper, firstly the differences in the approach required for designing routing algorithms for WSNs as compared to other Wireless networks is discussed. It is followed by a design issues in routing algorithms for WSNs. The paper concludes with possible future research areas. | en |
dc.relation.ispartofseries | IDFME005-1 | en |
dc.subject | Communication | en |
dc.subject | Routing | en |
dc.subject | Sensor Nodes | en |
dc.subject | Wireless Networks | en |
dc.subject | IDFME005 | - |
dc.subject | Mechanical Faculty Paper | - |
dc.subject | Faculty Paper | - |
dc.subject | ITFEC004 | - |
dc.title | Design Challenges of Routing Algorithms | en |
dc.type | Faculty Papers | en |
Appears in Collections: | Faculty Papers, ME - IDs |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
IDFME005-1.pdf | IDFME005-1 | 35.55 kB | Adobe PDF | ![]() View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.