Results 1 - 10 of 45

Wireless mesh networks: a survey

by Ian F. Akyildiz, Xudong Wang, Weilin Wang - COMPUTER NETWORKS , 2005
"... Wireless meshnet8Ex8 (WMNs)consist of meshrout6L and meshclient8 where meshroutfix have minimal mobilit and formtr backbone of WMNs. They provide netide access for bot mesh andconvent1)fi8 clientt TheintL gratLfl of WMNs wit ot8 net8866 such as t1Int6fiPx1 cellular, IEEE 802.11, IEEE 802.15, IEEE 8 ..."
Abstract - Cited by 687 (12 self) - Add to MetaCart
Wireless meshnet8Ex8 (WMNs)consist of meshrout6L and meshclient8 where meshroutfix have minimal mobilit and formtr backbone of WMNs. They provide netide access for bot mesh andconvent1)fi8 clientt TheintL gratLfl of WMNs wit ot8 net8866 such as t1Int6fiPx1 cellular, IEEE 802.11, IEEE 802.15, IEEE 802.16, sensor netsor1L ets can be accomplishedtccomp tc gatomp and bridging functng1 in t1 meshroutfijx Meshclient can be eit8fi st8fij1)6x or mobile, and can form aclient meshnet16S amongtng1fifiELj and wit meshroutLfifi WMNs are antLfifl1)6fl t resolvets limit18fiflfl andt significantfl improvetp performance of ad hocnetLEP8L wireless local area net1Pxx (WLANs), wireless personal areanet16fij (WPANs), and wirelessmetess1fifljfl areanet1LPS (WMANs). They are undergoing rapid progress and inspiring numerousdeploymentS WMNs will deliver wireless services for a largevariet ofapplicat6fifl in personal, local, campus, andmet8Lfix1)6fi areas. Despit recent advances in wireless mesh netjLfiP1)6 many research challenges remain in allprotjfiS layers. This paperpresent adetEfl81 stEonrecent advances and open research issues in WMNs. Syst1 architL881)6 andapplicat)68 of WMNs are described, followed by discussingts critssi factss influencingprotenc design.Theoret8fiL netore capacit and tdst1LLSjx tt1LL protLLSj for WMNs are exploredwit anobjectE1 t point out a number of open research issues. Finally,tnal beds,indust681 pract68 andcurrent strent actntx1) relatt t WMNs arehighlight8x # 2004 Elsevier B.V. Allrl rl KedI7-8 Wireless meshnet186flfl Ad hocnet8jEES Wireless sensornetor16fl Medium accessconts1fi Routs1 prots1fiS Transport protspor ScalabilitS Securiti Powermanagement andcontfi8fl Timingsynchronizat ion 1389-1286/$ - seefront matt # 2004 Elsevier B.V. Allright reserved. doi:10....

Clustering Algorithms for Ad Hoc Wireless Networks

by Yuanzhu Peter Chen, Arthur L. Liestman, Jiangchuan Liu , 2004
"... An ad hoc network is a multihop wireless communication network supporting mobile users without any existing infrastructure. To become commercially successful, the technology must allow networks to support many users. A complication is that addressing and routing in ad hoc networks does not scale u ..."
Abstract - Cited by 51 (2 self) - Add to MetaCart
An ad hoc network is a multihop wireless communication network supporting mobile users without any existing infrastructure. To become commercially successful, the technology must allow networks to support many users. A complication is that addressing and routing in ad hoc networks does not scale up as easily as in the Internet. By introducing hierarchical addresses to ad hoc networks, we can effectively address this complication. Clustering provides a method to build and maintain hierarchical addresses in ad hoc networks. Here, we survey several clustering algorithms, concentrating on those that are based on graph domination. In addition, we describe results that show that building clustered hierarchies is affordable and that clustering algorithms can also be used to build virtual backbones to enhance network quality of service.

A performance comparison of protocols for clustering and backbone formation in large scale ad hoc networks

by Stefano Basagni, Michele Mastrogiovannit, Chiara Petriolit - In Proceedings of them 1st IEEE International Conference on Mobile Ad Hoc and Sensor Systems (MASS 2004), Fort Landerdale , 2004
"... Abstract-This paper concerns the comparative performance evaluation of protocols for clustering and backbone formation in ad hoc networks characterized by a large number of resource-constrained nodes. A typical example of these networks are wireless sensor networks. We selected protocols that repres ..."
Abstract - Cited by 26 (0 self) - Add to MetaCart
Abstract-This paper concerns the comparative performance evaluation of protocols for clustering and backbone formation in ad hoc networks characterized by a large number of resource-constrained nodes. A typical example of these networks are wireless sensor networks. We selected protocols that represent the main approaches to clustering and hackhone formation for ad hoc networks. The DCA protocol represents those protocols whose backbone construction method is based on selecting nodes as clusterheads and then joining them to form a connected backbone. The algorithm proposed by Wu and Li has been chosen to exemplify those algorithms that build a connected hackhone and then prune away redundant nodes. Finally, the algorithm by Wan et al. has heeu considered here for its more theoretical properties of producing a backbone with a constant approximation factor, linear time complexity and optimal mes-
(Show Context)

Survey on mobile ad hoc network routing protocols and cross-layer design

by Liang Qin, Thomas Kunz , 2004
"... A "mobile ad hoc network " (MANET) is an autonomous system of mobile routers connected by wireless links. The routers are free to move randomly and organize themselves arbitrarily; thus, the network's wireless topology may change rapidly and unpredictably. Such a network may o ..."
Abstract - Cited by 20 (0 self) - Add to MetaCart
A "mobile ad hoc network " (MANET) is an autonomous system of mobile routers connected by wireless links. The routers are free to move randomly and organize themselves arbitrarily; thus, the network's wireless topology may change rapidly and unpredictably. Such a network may operate in a standalone fashion, or may be connected to the Internet. Multi hop, mobility, large network size combined with device heterogeneity, bandwidth and battery power constrain make the design of adequate routing protocols a major challenge. In recent years, many routing protocols have been proposed for MANET. Basically these protocols can be fit in one of two major categories: on-demand such as AODV [1] and DSR [2], and proactive such as DSDV [3] and OLSR [4]. The review and performance comparison of these protocols are in [5][6][7]. A more comprehensive survey can be found in [8]. In this survey, we will not focus on individual routing protocols; instead we will discuss some new ideas proposed recently mainly to improve MANET throughput and scalability in different ways with some new routing metrics, new technologies such as multi-rate, multi-channel and hierarchical structure, by using cross-layer design. 1. Cross-layer Design of Multi-hop Wireless Networks
(Show Context)

On the design of secure protocols for hierarchical sensor networks

by Leonardo B. Oliveira - of Low_Window = 38, High_Window = 83000, High_P = 10^-7, and High_Decrease = 0.1 , 2006
"... ..."
Abstract - Cited by 10 (5 self) - Add to MetaCart
Abstract not found
(Show Context)

LHA-SP: Secure protocols for hierarchical wireless sensor networks

by Leonardo B. Oliveira, Hao Chi Wong, Antonio A. Loureiro - in: Ninth International Symposium on Integrated Network Management (IM’05), IFIP/IEEE , 2005
"... Wireless sensor networks (WSNs) are ad hoc networks comprised mainly of small sensor nodes with limited resources, and can be used to monitor areas of interest. In this paper, we propose a solution for securing heterogeneous hierarchical WSNs with an arbitrary number of levels. Our solution relies e ..."
Abstract - Cited by 9 (3 self) - Add to MetaCart
Wireless sensor networks (WSNs) are ad hoc networks comprised mainly of small sensor nodes with limited resources, and can be used to monitor areas of interest. In this paper, we propose a solution for securing heterogeneous hierarchical WSNs with an arbitrary number of levels. Our solution relies exclusively on symmetric key schemes, is highly distributed, and takes into account node interaction patterns that are specific to clustered WSNs.
(Show Context)

Distance-sensitive routing and information brokerage in sensor networks

by Stefan Funke, Leonidas J. Guibas, An Nguyen, Yusu Wang - in IEEE International Conference on Distributed Computing in Sensor System (DCOSS’06 , 2006
"... Abstract — In a sensor network information from multiple nodes must usually be aggregated in order to accomplish a certain task. A natural way to view this information gathering is in terms of interactions between nodes that are producers of information, e.g., those that have collected data, detecte ..."
Abstract - Cited by 9 (2 self) - Add to MetaCart
Abstract — In a sensor network information from multiple nodes must usually be aggregated in order to accomplish a certain task. A natural way to view this information gathering is in terms of interactions between nodes that are producers of information, e.g., those that have collected data, detected events, etc., and nodes that are consumers of information, i.e., nodes that seek data of certain types. Our overall goal in this paper is to construct efficient schemes allowing consumer and producer nodes to discover each other so that the desired information can be sent quickly to those who seek it. Here, efficiency is an issue for both the producers (limiting the redundancy of where information is stored) as well as the consumers (keeping the query time low). We introduce the notion of distance-sensitive information brokerage and provide schemes for efficiently bringing together information producers and consumers at a cost proportional to the separation between them—even though the consumers do not know the locations of the producers they seek. Our algorithms rely purely on the communication topology of the sensor network and do not require any geographic location information. In the process we introduce a new routing scheme that is of interest in its own right because it provides constant-factor approximations to the optimal paths. We give theoretical proofs of the efficiency of our scheme, as well as experimental results that further demonstrate its performance and suggest its practicality even for large scale sensor networks. I.
(Show Context)

Self-stabilizing construction of bounded size clusters

by Colette Johnen, Le Huy Nguyen - In International Symposium on Parallel and Distributed Processing with applications (ISPA’08 , 2008
"... Clustering means partitioning nodes into groups called clusters, providing the network with a hierarchical organization. A self-stabilizing protocol, regardless of the initial system state, automatically converges to a set of states that satisfy the problem specification without external interventio ..."
Abstract - Cited by 8 (7 self) - Add to MetaCart
Clustering means partitioning nodes into groups called clusters, providing the network with a hierarchical organization. A self-stabilizing protocol, regardless of the initial system state, automatically converges to a set of states that satisfy the problem specification without external intervention. Due to this property, self-stabilizing protocols are adapted to highly dynamic networks as ad hoc or sensors networks. In this paper, we propose a self-stabilizing clustering protocol. Our protocol guarantees a threshold (SizeBound) on the number of nodes that a clusterhead handle. Therefore, none of the clusterheads are overloaded at any time. The criterion of the clusterheads election is based on their weight value, a general parameter that can be computed according to several node parameters as transmission power, battery power,.... 1.
(Show Context)

Cluster Overlay Broadcast (COB): MANET Routing with Complexity Polynomial in Source-Destination Distance

by Luke Ritchie, Hyo-sik Yang, Andrea Richa, Martin Reisslein
"... Routing algorithms with time and message complexities that are provably low and independent of the total number of nodes in the network are essential for the design and operation of very large scale wireless mobile ad hoc networks (MANETs). In this paper we develop and analyze Cluster Overlay Broadc ..."
Abstract - Cited by 7 (1 self) - Add to MetaCart
Routing algorithms with time and message complexities that are provably low and independent of the total number of nodes in the network are essential for the design and operation of very large scale wireless mobile ad hoc networks (MANETs). In this paper we develop and analyze Cluster Overlay Broadcast (COB), a low-complexity routing algorithm for MANETs. COB runs on top of a 1-hop cluster cover of the network, which can be created and maintained using, for instance, the Least Cluster Change (LCC) algorithm. We formally prove that the LCC algorithm maintains a cluster cover with a constant density of cluster leaders with minimal update cost. COB discovers routes by flooding (broadcasting) route requests through the network of cluster leaders with a doubling radius technique. Building on the constant density property of the network of cluster leaders we formally prove that if there exists a route from a source to a destination node with a minimum hop count of ∆, then COB discovers a route with at most O(∆) hops from the source to the destination node in at most O(∆) time and by sending at most O( ∆ 2) messages. We prove this result for arbitrary node distributions and mobility patterns and also show that COB adapts asymptotically optimally to the mobility of the nodes. In our simulation experiments we examine the network layer performance of COB, compare it with Dynamic Source Routing, and investigate the impact of the MAC layer on COB routing. Index Terms 1-hop clustering, algorithm/protocol design and analysis, message complexity, routing protocol, scalability, time complexity, wireless mobile ad hoc network. I.
(Show Context)

Distance-Sensitive Information Brokerage in Sensor Networks

by Stefan Funke, Leonidas J. Guibas, An Nguyen, Yusu Wang
"... Abstract. In a sensor network information from multiple nodes must usually be aggregated in order to accomplish a certain task. A natural way to view this information gathering is in terms of interactions between nodes that are producers of information, e.g., those that have collected data, detected ..."
Abstract - Cited by 5 (1 self) - Add to MetaCart
Abstract. In a sensor network information from multiple nodes must usually be aggregated in order to accomplish a certain task. A natural way to view this information gathering is in terms of interactions between nodes that are producers of information, e.g., those that have collected data, detected events, etc., and nodes that are consumers of information, i.e., nodes that seek data or events of certain types. Our overall goal in this paper is to construct efficient schemes allowing consumer and producer nodes to discover each other so that the desired information can be delivered quickly to those who seek it. Here, efficiency means both limiting the redundancy of where producer information is stored, as well as bounding the consumer query times. We introduce the notion of distance-sensitive information brokerage and provide schemes for efficiently bringing together information producers and consumers at a cost proportional to the separation between them — even though neither the consumers nor the producers know about each other beforehand. Our brokerage scheme is generic and can be implemented on top of several hierarchical routing schemes that have been proposed in the past, provided that they are augmented with certain key sideway links. For such augmented hierarchical routing schemes we provide a rigorous theoretical performance analysis, which further allows us to prove worst case query times and storage requirements for our information brokerage scheme. Experimental results demonstrate that the practical performance of the proposed approaches far exceeds their theoretical (worstcase) bounds. The presented algorithms rely purely on the topology of the communication graph of the sensor network and do not require any geographic location information. 1
(Show Context)