Data Mining - Concepts and Techniques.

This paper presents control and coordination algorithms for groups of vehicles. The focus is on autonomous vehicle networks performing distributed sensing tasks where each vehicle plays the role of a mobile tunable sensor. The paper proposes gradient descent algorithms for a class of utility functions which encode optimal coverage and sensing policies. The resulting closed-loop behavior is adaptive, distributed, asynchronous, and verifiably correct.

Coverage control for mobile sensing networks

They are susceptible to a variety of attacks, including node capture, physical tampering, and denial of service, while prompting a range of fundamental research challenges.

/pdf/security-in-wireless-sensor-networks-119x7nks5g.pdf

Security in wireless sensor networks

The introduction of intelligent devices with short range wireless communication techniques has motivated the development of Mobile Ad hoc NETworks (MANETs) during the last few years. However, traditional end-to-end based routing algorithms designed for MANETs are not much robust in the challenged networks suffering from frequent disruption, sparse network density and limited device capability. Such challenged networks, also known as Intermittently Connected Networks (ICNs) adopt the Store-Carry-Forward (SCF) behavior arising from the mobility of mobile nodes for message relaying. In this article, we consider the term ICNs as Delay/Disruption Tolerant Networks (DTNs) for the purpose of generalization, since DTNs have been envisioned for different applications with a large number of proposed routing algorithms. Motivated by the great interest from the research community, we firstly review the existing unicasting issue of DTNs because of its extensive research stage. Then, we also address multicasting and anycasting issues in DTNs considering their perspectives. A detail survey based on our taxonomy over the period from 2006 to 2010 is not only provided but also a comparison is given. We further identify the remaining challenges and open issues followed by an evaluation framework proposed for routing in DTNs. Finally, we summarize our contribution with three future research topics highlighted.

Routing in Delay/Disruption Tolerant Networks: A Taxonomy, Survey and Challenges

Nowadays, wireless networks are witnessing several deployments in various extreme environments where they suffer from different levels of link disruptions depending on the severity of the operating conditions. In all cases, their operation requirements are differently altered and their performance is negatively affected rendering them heterogeneous by nature. In the open literature, these networks are known as Intermittently Connected Networks (ICNs). The existing Internet protocols fail to operate properly in the context of ICNs, thus raising a variety of new challenging problems that are attracting the attention of the networking research community. Delay-/Disruption-Tolerant Networking emerged as a highly active area of research where networking experts compete in addressing the various ICN problems. Over time, unicast routing, one of the architectural key components common to all ICNs, became an almost independent field of research in which significant efforts continue to be invested. In contrast, network architectural designs, scheduling and forwarding issues dating from the early days of Inter-Planetary Networks (IPNs) have received relatively little attention and accumulate numerous pending challenges. Moreover, the gap caused by the lack of accurate ICN mathematical models is still large irrespective of some of the appreciated seminal works in this direction. This paper sheds the light over the latest advancements in each of the above-mentioned research sectors and highlight pending open issues in each of them.

Disruption-Tolerant Networking: A Comprehensive Survey on Recent Developments and Persisting Challenges

The National Highway Traffic Safety Administration data show that drowsy driving causes more than 100,000 crashes a year. In order to prevent these devastating accidents, it is necessary to build a reliable driver drowsiness detection system which could alert the driver before a mishap happens. In the literature, the drowsiness of a driver can be measured by vehicle-based, behavior-based, and physiology-based approaches. Comparing with the vehicle-based and behavior-based measurements, the physiological measurement of drowsiness is more accurate. With the latest release of wireless wearable devices such as biosensors that can measure people's physiological data, we aim to explore the possibility of designing a user-friendly and accurate driver drowsiness detection system using wireless wearables. In this paper, we use a wearable biosensor called Bio Harness 3 produced by Zephyr Technology to measure a driver's physiological data. We present our overall design idea of the driver drowsiness detection system and the preliminary experimental results using the biosensor. The detection system will be designed in two phases: The main task of the first phase is to collect a driver's physiological data by the biosensor and analyze the measured data to find the key parameters related to the drowsiness. In the second phase, we will design a drowsiness detection algorithm and develop a mobile app to alert drowsy drivers. The results from this project can lead to the development of real products which can save many lives and avoid many accidents on the road. Furthermore, our results can be widely applied to any situation where people should not fall asleep: from the applications in mission-critical fields to the applications in everyday life.

/pdf/detecting-driver-drowsiness-using-wireless-wearables-g52lqdpy56.pdf

Detecting Driver Drowsiness Using Wireless Wearables

This chapter gives a general survey of multicast protocols in mobile ad hoc networks (MANETs). After giving a brief summary of two multicast protocols in wired networks--shortest path multicast tree protocol and core-based tree multicast protocol -- we point out limitations of these protocols when they are applied in the highly dynamic environment of MANETs. Four multicast protocols -- On-Demand Multicast Routing Protocol (ODMRP), Multicast Ad Hoc On-Demand Distance Vector Routing Protocol (Multcast AODV), Forwarding Group Multicast Protocol (FGMP), and Core-Assisted Mesh Protocol -- are discussed in detail with a focus on how the limitations of multicast protocols in wired networks are overcome. A brief overview of other multicast protocols in MANETs is provided. The chapter ends with two important related issues: QoS multicast and reliable multicast in MANETs.

Multicasting techniques in mobile ad hoc networks

Due to different requirements in applications, sensors with different capacities are deployed. How to design efficient, reliable and scalable routing protocols in such wireless heterogeneous sensor networks (WHSNs) with intermittent asymmetric links is a challenging task. In this paper, we propose ProHet: a distributed probabilistic routing protocol for WHSNs that utilizes asymmetric links to reach assured delivery rate with low overhead. The ProHet protocol first produces a bidirectional routing abstraction by finding a reverse path for every asymmetric link. Then, it uses a probabilistic strategy to choose forwarding nodes based on historical statistics using local information. Analysis shows that ProHet can achieve assured delivery rate ρ if ρ is set within its upper-bound. Extensive simulations are conducted to verify its efficiency.

/pdf/prohet-a-probabilistic-routing-protocol-with-assured-3d5i8vado7.pdf

ProHet: A Probabilistic Routing Protocol with Assured Delivery Rate in Wireless Heterogeneous Sensor Networks

Broadcasting is an important communication mechanism in ad hoc wireless networks. The simplest way to do broadcasting is pure flooding, in which each node retransmits a packet after receiving it, thus generates many redundant retransmissions. The rule based on dominating sets can reduce the number of retransmissions. A dominating set is a set of nodes such that any node in the network is a neighbor of some element in the set. However, computing a minimum size connected dominating set is NP hard. Several existing algorithms use the idea of multipoint relays to reduce the size of the connected dominating set. The authors of this paper observed that these algorithms can be further improved. Thus, three improvements are introduced here. It is proved that these improvements can compute a connected dominating set of the network, and simulation results show that they can further reduce the size of the dominating set. Also, extensions to power-aware broadcasting algorithms are discussed.

Reducing connected dominating set size with multipoint relays in ad hoc wireless networks

Delay tolerant networks are a type of wireless mobile networks that do not guarantee the existence of a path between a source and a destination at any time In such a network, one of the critical issues is to reliably deliver data with a low latency Naive forwarding approaches, such as flooding and its derivatives, make the routing cost (here defined as the number of copies duplicated for a message) very high Many efforts have been made to reduce the cost while maintaining performance Recently, an approach called delegation forwarding (DF) caught significant attention in the research community because of its simplicity and good performance In a network with N nodes, it reduces the cost to O( √ N) which is better than O(N) in other methods In this paper, we extend the DF algorithm by putting forward a new scheme called probability delegation forwarding (PDF) that can further reduce the cost to O(N 2+2p), p ∈ (0, 1) Simulation results show that PDF can achieve similar delivery ratio, which is the most important metric in DTNs, as the DF scheme at a lower cost if p is not too small In addition, we propose the threshold probability delegation forwarding (TPDF) scheme to close the latency gap between the DF and PDF schemes

/pdf/probability-delegation-forwarding-in-delay-tolerant-networks-3wn8rsiu2y.pdf

Xiao Chen

Papers

Detecting Driver Drowsiness Using Wireless Wearables

Multicasting techniques in mobile ad hoc networks

ProHet: A Probabilistic Routing Protocol with Assured Delivery Rate in Wireless Heterogeneous Sensor Networks

Reducing connected dominating set size with multipoint relays in ad hoc wireless networks

Probability Delegation Forwarding in Delay Tolerant Networks