Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/127044
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAndrey V. Krendzel
dc.date.accessioned2017-04-30T13:25:36Z-
dc.date.available2017-04-30T13:25:36Z-
dc.date.issued2012
dc.identifier.isbn978-953-51-0672-2
dc.identifier.urihttp://hdl.handle.net/123456789/127044-
dc.description.abstractThis book provides an in-depth look into recent advances in relation to novel design strategies and algorithms to improve performance and functionality of WMNs. Ten contributed chapters written by a group of well-known experts in wireless mesh networking are arranged in two parts. The first part of the book focuses on link scheduling schemes to select a subset of links for simultaneous transitions under interference constraints in an efficient and fair manner to guarantee a certain level of network connectivity. Besides, it describes channel assignment strategies to improve the network throughput in multi-radio multi-channel WMNs by means of an efficient channel utilization and minimization of the interference. The second part of the book addresses some important network planning issues related to efficient routing protocols in dynamic large-scale mesh environment, achievable capacity limit of a single wireless link between two multi-interface mesh nodes, the correctness of the mesh security architecture, fault-tolerant mesh network topology planning.
dc.language.isoeng
dc.publisherInTech
dc.relation.isbasedon10.5772/2612
dc.relation.urihttp://www.intechopen.com/books/wireless-mesh-networks-efficient-link-scheduling-channel-assignment-and-network-planning-strategies
dc.rights.uriCC by (姓名標示)
dc.sourceInTech
dc.subject.classificationEngineering
dc.subject.classification Electrical and Electronic Engineering
dc.titleWireless Mesh Networks - Efficient Link Scheduling, Channel Assignment and Network Planning Strategies
dc.type電子教課書
dc.classification應用科學類
Theme:教科書-應用科學類

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.