Results 1 - 10
of
10
Low-Interference Topology Control for Wireless Ad Hoc Networks
- ACM Wireless Networks
, 2005
"... supported by NSF CCR-0311174. Abstract — Topology control has been well studied in wireless ad hoc networks. However, only a few topology control methods take into account the low interference as a goal of the methods. Some researchers tried to reduce the interference by lowering node energy consump ..."
Abstract
-
Cited by 79 (1 self)
- Add to MetaCart
(Show Context)
supported by NSF CCR-0311174. Abstract — Topology control has been well studied in wireless ad hoc networks. However, only a few topology control methods take into account the low interference as a goal of the methods. Some researchers tried to reduce the interference by lowering node energy consumption (i.e. by reducing the transmission power) or by devising low degree topology controls, but none of those protocols can guarantee low interference. Recently, Burkhart et al. [?] proposed several methods to construct topologies whose maximum link interference is minimized while the topology is connected or is a spanner for Euclidean length. In this paper we give algorithms to construct a network topology for wireless ad hoc network such that the maximum (or average) link (or node) interference of the topology is either minimized or approximately minimized. Index Terms — Topology control, interference, wireless ad hoc networks.
A Distributed Algorithm for Mesh Scatternet Formation in Bluetooth Networks
"... Bluetooth is a promising new wireless technology that enables portable devices to form short-range multi-hop wireless ad-hoc networks. Bluetooth Scatternet Formation is one of the challenges that needs to be resolved. In this paper, we present a new, distributed Bluetooth mesh scatternet formation a ..."
Abstract
-
Cited by 7 (0 self)
- Add to MetaCart
Bluetooth is a promising new wireless technology that enables portable devices to form short-range multi-hop wireless ad-hoc networks. Bluetooth Scatternet Formation is one of the challenges that needs to be resolved. In this paper, we present a new, distributed Bluetooth mesh scatternet formation algorithm. The generated scatternet is a connected mesh which, in addition to meeting the minimum criteria of reachability, provides many desirable properties such as small network diameter, multiple paths between any pair of nodes, low node contention, easier routing and scheduling. The simulations results for the experiments conducted in Blueware simulator [3] are also provided. The time required for mesh scatternet formation is seen to be increasing logarithmically with increasing number of devices. We compare the scatternet formation time and number of piconets generated with that of TSF. We find that in comparison to TSF, with a slight increase in scatternet formation time, we gain by reducing the number of piconets significantly.
Meshes and cubes: Distributed scatternet formations for Bluetooth personal area networks
- Bluetooth Personal Area Networks”, Master’s thesis
, 2004
"... The members of the Committee appointed to examine the thesis of ANIRUDDHA SHRIRAM DAPTARDAR find it satisfactory and recommend that it be accepted. ii Chair ACKNOWLEDGEMENT First and foremost, I would like to thank that eternal power which exists in this world, we call GOD, which has helped me in a ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
The members of the Committee appointed to examine the thesis of ANIRUDDHA SHRIRAM DAPTARDAR find it satisfactory and recommend that it be accepted. ii Chair ACKNOWLEDGEMENT First and foremost, I would like to thank that eternal power which exists in this world, we call GOD, which has helped me in a number of ways. I have faced many challenges during this eventful journey and I am grateful to GOD for helping me come out of all those safe and sound. This thesis is dedicated to my family, Aai (Dr. Mrs. Vaidehi Daptardar), Baba (Mr. Shriram Daptardar) and my sweet younger sister, chingi (Ms. Sayali Daptardar). Without their love, support and motivation, I would not have reached this stage and this work would have been far from complete. Aai and Baba have always been more than a friend to me and have provided me with their valuable suggestions and shared their experience from time to time. They have shown me a path to walk on with their own footprints. They have given me the inspiration needed to face all the twists and turns of life with courage. The home-made food has always kept me healthy and
On Minimum-Energy Broadcasting
- in All Wireless Networks, in the proc. of IEEE LCN'2001
"... and topology control in wireless ad hoc networks Network wide broadcasting in Mobile Ad Hoc Networks (MANET) provides important control and route establishment functionality for a number of unicast and multicast protocols. We present an overview of the recent progress of broadcasting and multicastin ..."
Abstract
-
Cited by 4 (2 self)
- Add to MetaCart
(Show Context)
and topology control in wireless ad hoc networks Network wide broadcasting in Mobile Ad Hoc Networks (MANET) provides important control and route establishment functionality for a number of unicast and multicast protocols. We present an overview of the recent progress of broadcasting and multicasting in wireless ad hoc networks. We discuss two energy models that could be used for broadcast: one is non-adjustable power and one is adjustable power. If the power consumed at each node is not adjustable, minimizing the total power used by a reliable broadcast tree is equivalent to the minimum connected dominating set problem (MCDS), i.e., minimize the number of nodes that relay the message, since all relaying nodes of a reliable broadcast form a connected dominating set (CDS). If the power consumed at each node is adjustable, we assume that the power consumed by a relay node u is �uv � β, where real number β ∈ [2, 5] depends on transmission environment and v is the farthest neighbor of u in the broadcast tree. For both models, we reviewed several centralized methods that compute broadcast trees consuming the energy within a constant factor of the optimum if the original communication graph is unit disk graph. Since centralized methods are expensive to implement, We further reviewed several localized methods that can approximate the minimum energy broadcast tree for non-adjustable power case. For adjustable power case, no localized methods can approximate the minimum energy broadcast tree and thus review several currently best possible heuristics. Several local improvement methods and activity scheduling of nodes (active, idle, sleep) are also discussed.
Predictive Protocol Management with Contingency Planning for Wireless Sensor Networks
"... Abstract — Wireless Sensor Networks (WSN) are a subset of wireless networking applications focused on enabling sensor and actuator connectivity without the use of wires. Energy consumption among the wireless devices participating in these networks is a major constraint on the deployment for a broad ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract — Wireless Sensor Networks (WSN) are a subset of wireless networking applications focused on enabling sensor and actuator connectivity without the use of wires. Energy consumption among the wireless devices participating in these networks is a major constraint on the deployment for a broad range of applications enabled by WSNs. This paper introduces, for the first time, a novel methodology based on predictive protocol management with contingency planning (PPM and CP). This approach allows efficient update of the WSN operational mode in order to optimize the energy utilization based on the time varying characteristics of the Radio-Frequency (RF) in which the network operates. I.
CBRBrain: Provide Content Based Routing Service Over Internet Backbone
"... Abstract — Peer-to-peer(P2P) networking has come to a family of technologies and techniques for organizing distributed applications, which takes advantage of resources available at the Internet edges. In this paper, we propose an innovative P2P system architecture, called CBRBrain, to implement the ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract — Peer-to-peer(P2P) networking has come to a family of technologies and techniques for organizing distributed applications, which takes advantage of resources available at the Internet edges. In this paper, we propose an innovative P2P system architecture, called CBRBrain, to implement the content based routing (CBR) service over the backbone routers instead of at the terminal hosts. Hence CBRBrain avoids some drawbacks in previous P2P systems and significantly improves the efficiency and security. Data locating process is easily implemented on CBRBrain by associating a hashed key with each data item and storing the (key, address) pair in routers. The cost for topology update is neglectful since the routers is almost static in Internet and the topology is not affected by the frequent joining and leaving of hosts at all. The traffic generated by CBRBrain system over Internet is also expected to be significantly smaller compared with other P2P systems. The CBRBrain backbone adopts the self-routing structure de Bruijn graph as the topology, which has a number of preferred properties such as bounded degrees, low diameters and fault tolerance. As an illustration, we describe the mechanism of P2P file sharing application under CBRBrain architecture. Our work is a first step to provide an intelligent backbone as the core of the next Internet. An implicit contribution of CBRBrain is to facilitate the emergence of various intelligent applications over Internet, besides P2P file sharing. Index Terms — system design, P2P networking, content based routing, de Bruijn graph, bounded degree, low diameter.
Implementing the IT Balanced Scorecard: Aligning IT with Corporate Strategy
"... ISBN: 0849327687 Disassembly Modeling for Assembly, ..."
Hierarchical Self-routing Scatternet for Multihop Bluetooth Networks
"... The paper proposes a strategy for each Bluetooth device selecting proper communication neighbors and assigning proper label, hence all nodes together form a hierarchical self-routing Bluetooth networks. Both the scatternet formation and routing protocols do not require any geometric information, and ..."
Abstract
- Add to MetaCart
The paper proposes a strategy for each Bluetooth device selecting proper communication neighbors and assigning proper label, hence all nodes together form a hierarchical self-routing Bluetooth networks. Both the scatternet formation and routing protocols do not require any geometric information, and the final network topology has the following attractive properties: (1) the diameter of the scatternet is O(log(n)) and the backbone is a hop spanner; (2) the degree of each master node is bounded by a constant 7; (3) the number of piconets is close to optimal; (4) each cluster has self-routing property. Moreover, the network topology can be maintained dynamically and locally with low communication cost, and the message delivery is guaranteed even during structure updating in clusters. The network supports efficient IP-based routing through Distributed Hash Tables(DHTs). The actual routing performance on the structure is evaluated through extensive simulations, the result shows the average communication hops are indeed around log(n).
Multihop Scatternet Formation and Routing for Large Scale
"... Abstract: This paper addresses the scatternet formation for large scale multi-hop Bluetooth net-works. We first describe a novel communication efficient method to build a connected dominating set (CDS) as the backbone of multi-hop Bluetooth network, then propose new algorithms to form the dBBlue sca ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract: This paper addresses the scatternet formation for large scale multi-hop Bluetooth net-works. We first describe a novel communication efficient method to build a connected dominating set (CDS) as the backbone of multi-hop Bluetooth network, then propose new algorithms to form the dBBlue scatternets [1] in each cluster. Notice that our methods is not a simple combina-tion of existing CDS methods and dBBlue algorithm. We propose a new algorithm for finding the connectors in CDS that are more suitable for multihop Bluetooth networks and several new algorithms to enable formation of dBBlue scatternets inside each cluster. The final scatternet, M-dBBlue, guarantees the connectivity. Our experiment shows the majority of nodes have degree smaller or equal to 7 which means our scatternet seldom parks any node. Our scatternet also en-joys efficient updating, since both the backbone and the dBBlue structure of each cluster can be maintained efficiently in a dynamic environment. We then propose a complete set of hierarchical routing methods for M-dBBlue which enables the self-routing inside each cluster. Moreover, our scatternet formation and routing algorithm do not require any position information at all.
