We introduce the prefix routing over set elements (PROSE) protocol for scalable routing in MANETs based on the combined use of prefix labels and distributed hashing. In PROSE, nodes use neighbor-to-neighbor signaling ...
详细信息
We introduce the prefix routing over set elements (PROSE) protocol for scalable routing in MANETs based on the combined use of prefix labels and distributed hashing. In PROSE, nodes use neighbor-to-neighbor signaling to label themselves with prefix labels that provide implicit routing from any node to any network destination. Nodes implement a distributed hash table to store the mappings between node identifiers (e.g., a MAC or IP address) and their prefix labels. Destinations publish their existence and sources subscribe to their intended destinations. We show that PROSE provides correct routing based on prefix labels and that its signaling overhead grows sub-linearly withthe network size. We present simulation and testbed results that illustrate the benefits of PROSE compared to traditional MANET routing protocols.
Embedded sensor networks are distributedsystems for sensing and in situ processing of spatially and temporally dense data from resource-limited and harsh environments such as seismic zones, ecological contamination s...
详细信息
Wireless sensor networks can monitor physical and environmental conditions inexpensively, and the networks have been widely used in military and civilian applications. the sensor nodes in the networks not only have th...
详细信息
Wireless sensor networks can monitor physical and environmental conditions inexpensively, and the networks have been widely used in military and civilian applications. the sensor nodes in the networks not only have the ability to sense, but also can supply data storage, computation and communicate with each other. However, energy efficiency is the major concern in wireless sensor networks, which usually rely on battery for energy source. Centralized data storage and query processing schemes lead to high energy consumption. this paper proposes a distributed data storage scheme (DDS) that disseminates related event data in a neighborhood in wireless sensor networks. Besides offering data query according to event names, DDS also provides distributed querying. Experimental results show that the DDS scheme yields higher efficiency and effectiveness than the centralized scheme.
We introduce and study the localization problem in large scale underwater acoustic sensor networks. Considering that depth information is typically available for underwater sensors, we transform the 3D underwater posi...
详细信息
We introduce and study the localization problem in large scale underwater acoustic sensor networks. Considering that depth information is typically available for underwater sensors, we transform the 3D underwater positioning problem into its two-dimensional counterpart via a projection technique. We then introduce a localization scheme specifically designed for large scale acoustic underwater sensor networks. the proposed localization scheme does not require time-synchronization in the network. this scheme relies on time-differences of arrival (TDoA) measured locally at a sensor to detect range differences from the sensor to three anchors that can mutually hear each other. We consider variations in the speed of sound and analyze the performance of the proposed scheme in terms of the number of localized nodes, location errors, and the number of reference nodes.
Random walk is one of the widely used techniques for information discovery in unstructured networks like ad hoc wireless networks (AWNs) and wireless sensor networks (WSNs). In a random walk, instead of taking all ste...
详细信息
Random walk is one of the widely used techniques for information discovery in unstructured networks like ad hoc wireless networks (AWNs) and wireless sensor networks (WSNs). In a random walk, instead of taking all steps uniform randomly, our idea is to modify random walk to take some level biased steps to improve its energy efficiency and latency which are important design parameters in WSNs. the level of a node is defined as the minimum number of hops required for a packet to reach the sink node from that node. We propose two walk based search protocols viz., several short random walks (SSRW) search and random walk with level biased jumps (RWLBJ) search, that use a combination of uniform random and level biased steps for energy efficient search in WSNs. the idea is that the biased steps in the proposed protocols decrease the correlation among visited sensor nodes which increases the node coverage of the protocols. We show by theoretical analysis that using biased steps in random walks increases their efficiency in terms of energy consumption and latency of search. We also show by extensive simulations that SSRW and RWLBJ are better choices compared to that of pure random walk in terms of the energy consumption and latency of search.
Geographic forwarding is a favorable scheme for data reporting in wireless sensor networks (WSNs) due to its simplicity and low-overhead. However, WSNs are usually subject to complicated environmental factors. Network...
详细信息
ISBN:
(纸本)9781424451142
Geographic forwarding is a favorable scheme for data reporting in wireless sensor networks (WSNs) due to its simplicity and low-overhead. However, WSNs are usually subject to complicated environmental factors. Network holes (i.e., the areas where no nodes inside) and barriers (i.e., those blocking the communication between two close nodes) are inevitable in practical deploying environments. these issues pose an obstacle to adopting geographic forwarding in WSNs, while current approaches lack an efficient method to tolerate such negative factors. In this paper we specifically tailor a waypoint-based geographic data reporting protocol (GDRP) for WSNs. Inherited from geographic forwarding, GDRP is light-weighted and hence well-suits WSNs. But unlike current approaches that often find suboptimal paths, GDRP adopts an intelligent strategy to select a best set of waypoints via which packets can efficiently circumvent holes and barriers, and it can thus find better paths. Extensive simulations are conducted to verify the advantages of GDRP in tolerating network holes and obstacles in WSNs.
Data fusion or In-network processing methods were often adopted in Wireless sensor Networks (WSNs) to reduce data communication and prolong network lifetime, which made WSNs application can be described as a set of ta...
详细信息
Data fusion or In-network processing methods were often adopted in Wireless sensor Networks (WSNs) to reduce data communication and prolong network lifetime, which made WSNs application can be described as a set of tasks (sensing, processing) and dependencies among them. Task assignment has become an important problem which needed to be resolved for different tasks assignment caused different energy consumption. Based on the task graph of WSNs, an energy-efficient task assignment framework was proposed. As application task can be decomposed into sensing subtasks and processing subtasks, we present the task assignment as sensing subtask assignment and processing subtask assignment. We formulate the processing subtask assignment as a 0-1 quadratic programming problem and evaluate it through experiments.
In this work, we addressed the need for cross-layer optimizations in wireless security. We proposed a cross-layer security framework with interactions across layer boundaries (vertical optimization) as well as node bo...
详细信息
In this work, we addressed the need for cross-layer optimizations in wireless security. We proposed a cross-layer security framework with interactions across layer boundaries (vertical optimization) as well as node boundaries (horizontal optimization). We modeled different attacks at the network layer and application layer to illustrate the detection performance of the XLSEC framework. Preliminary simulation results indicate high detection gains using such cross-layer adaptations.
Researchers continue to demonstrate the benefits of Mining Software Repositories (MSR) for supporting software development and research activities. However, as the mining process is time and resource intensive, they o...
详细信息
ISBN:
(纸本)9781424434930
Researchers continue to demonstrate the benefits of Mining Software Repositories (MSR) for supporting software development and research activities. However, as the mining process is time and resource intensive, they often create their own distributed platforms and use various optimizations to speed up and scale up their analysis. these platforms are project-specific, hard to reuse, and offer minimal debugging and deployment support. In this paper, we propose the use of MapReduce, a distributedcomputing platform, to support research in MSR. As a proof-of-concept, we migrate J-REX, an optimized evolutionary code extractor, to run on Hadoop, an open source implementation of MapReduce. through a case study on the source control repositories of the Eclipse, BIRT and Datatools projects, we demonstrate that the migration effort to MapReduce is minimal and that the benefits are significant, as running time of the migrated J-REX is only 30% to 50% of the original J-REX's. this paper documents our experience withthe migration, and highlights the benefits and challenges of the MapReduce framework in the MSR community.
Data sharing is one of the most popular applications that dominate 70% of data traffic on the Internet. this application has been penetrating wireless mobile networks with dramatic speed, which allows the sharing of d...
详细信息
ISBN:
(纸本)9781424451142
Data sharing is one of the most popular applications that dominate 70% of data traffic on the Internet. this application has been penetrating wireless mobile networks with dramatic speed, which allows the sharing of data whenever and wherever. However, traditional client-server data sharing model suffers from single point failure and low-scalable transmission in a highly dense and dynamic scenario. MANET is a promising alternative structure for flexible and distributed data sharing. However, the topology-based flooding employed in MANETs for data routing and querying prevents the data sharing system from achieving high scalability and robustness. Building a DHT on a MANET reduces data query overhead, but the inconsistency between the overlay and the underlying topology degrade system's performance. Geographic routing based data sharing in MANETs reduces the data routing overhead. However, it has more requirements (e.g. GPS) on the nodes. this paper presents a locality-based distributed data sharing system (LORD) for mobility and congestion resilient data management. LORD consists of a DHT-based data index and retrieval protocol and a locality-aware region-based data routing protocol. It provides highly efficient, scalable and dynamism-resilient data sharing with low overhead. Moreover, it offers similarity data searching function. theoretical analysis and simulation results show the superiority of LORD compared with other data sharing systems in terms of scalability, overhead and dynamism-resilience in a highly dense and dynamic MANET.
暂无评论