2,627 research outputs found

    Message and time efficient multi-broadcast schemes

    Full text link
    We consider message and time efficient broadcasting and multi-broadcasting in wireless ad-hoc networks, where a subset of nodes, each with a unique rumor, wish to broadcast their rumors to all destinations while minimizing the total number of transmissions and total time until all rumors arrive to their destination. Under centralized settings, we introduce a novel approximation algorithm that provides almost optimal results with respect to the number of transmissions and total time, separately. Later on, we show how to efficiently implement this algorithm under distributed settings, where the nodes have only local information about their surroundings. In addition, we show multiple approximation techniques based on the network collision detection capabilities and explain how to calibrate the algorithms' parameters to produce optimal results for time and messages.Comment: In Proceedings FOMC 2013, arXiv:1310.459

    A Survey on Wireless Sensor Network Security

    Full text link
    Wireless sensor networks (WSNs) have recently attracted a lot of interest in the research community due their wide range of applications. Due to distributed nature of these networks and their deployment in remote areas, these networks are vulnerable to numerous security threats that can adversely affect their proper functioning. This problem is more critical if the network is deployed for some mission-critical applications such as in a tactical battlefield. Random failure of nodes is also very likely in real-life deployment scenarios. Due to resource constraints in the sensor nodes, traditional security mechanisms with large overhead of computation and communication are infeasible in WSNs. Security in sensor networks is, therefore, a particularly challenging task. This paper discusses the current state of the art in security mechanisms for WSNs. Various types of attacks are discussed and their countermeasures presented. A brief discussion on the future direction of research in WSN security is also included.Comment: 24 pages, 4 figures, 2 table

    Energy-Optimal Scheduling in Low Duty Cycle Sensor Networks

    Get PDF
    Energy consumption of a wireless sensor node mainly depends on the amount of time the node spends in each of the high power active (e.g., transmit, receive) and low power sleep modes. It has been well established that in order to prolong node's lifetime the duty-cycle of the node should be low. However, low power sleep modes usually have low current draw but high energy cost while switching to the active mode with a higher current draw. In this work, we investigate a MaxWeightlike opportunistic sleep-active scheduling algorithm that takes into account time- varying channel and traffic conditions. We show that our algorithm is energy optimal in the sense that the proposed ESS algorithm can achieve an energy consumption which is arbitrarily close to the global minimum solution. Simulation studies are provided to confirm the theoretical results

    Latency Optimal Broadcasting in Noisy Wireless Mesh Networks

    Full text link
    In this paper, we adopt a new noisy wireless network model introduced very recently by Censor-Hillel et al. in [ACM PODC 2017, CHHZ17]. More specifically, for a given noise parameter p[0,1],p\in [0,1], any sender has a probability of pp of transmitting noise or any receiver of a single transmission in its neighborhood has a probability pp of receiving noise. In this paper, we first propose a new asymptotically latency-optimal approximation algorithm (under faultless model) that can complete single-message broadcasting task in D+O(log2n)D+O(\log^2 n) time units/rounds in any WMN of size n,n, and diameter DD. We then show this diameter-linear broadcasting algorithm remains robust under the noisy wireless network model and also improves the currently best known result in CHHZ17 by a Θ(loglogn)\Theta(\log\log n) factor. In this paper, we also further extend our robust single-message broadcasting algorithm to kk multi-message broadcasting scenario and show it can broadcast kk messages in O(D+klogn+log2n)O(D+k\log n+\log^2 n) time rounds. This new robust multi-message broadcasting scheme is not only asymptotically optimal but also answers affirmatively the problem left open in CHHZ17 on the existence of an algorithm that is robust to sender and receiver faults and can broadcast kk messages in O(D+klogn+polylog(n))O(D+k\log n + polylog(n)) time rounds.Comment: arXiv admin note: text overlap with arXiv:1705.07369 by other author

    Randomized Initialization of a Wireless Multihop Network

    Full text link
    Address autoconfiguration is an important mechanism required to set the IP address of a node automatically in a wireless network. The address autoconfiguration, also known as initialization or naming, consists to give a unique identifier ranging from 1 to nn for a set of nn indistinguishable nodes. We consider a wireless network where nn nodes (processors) are randomly thrown in a square XX, uniformly and independently. We assume that the network is synchronous and two nodes are able to communicate if they are within distance at most of rr of each other (rr is the transmitting/receiving range). The model of this paper concerns nodes without the collision detection ability: if two or more neighbors of a processor uu transmit concurrently at the same time, then uu would not receive either messages. We suppose also that nodes know neither the topology of the network nor the number of nodes in the network. Moreover, they start indistinguishable, anonymous and unnamed. Under this extremal scenario, we design and analyze a fully distributed protocol to achieve the initialization task for a wireless multihop network of nn nodes uniformly scattered in a square XX. We show how the transmitting range of the deployed stations can affect the typical characteristics such as the degrees and the diameter of the network. By allowing the nodes to transmit at a range r= \sqrt{\frac{(1+\ell) \ln{n} \SIZE}{\pi n}} (slightly greater than the one required to have a connected network), we show how to design a randomized protocol running in expected time O(n3/2log2n)O(n^{3/2} \log^2{n}) in order to assign a unique number ranging from 1 to nn to each of the nn participating nodes
    corecore