Location-aware technology spawns numerous unforeseen pervasive applications in a wide range of living, pro- duction, commence, and public services. This article provides an overview of the location, localization, and ...Location-aware technology spawns numerous unforeseen pervasive applications in a wide range of living, pro- duction, commence, and public services. This article provides an overview of the location, localization, and localizability issues of wireless ad-hoc and sensor networks. Making data geographically meaningful, location information is essential for many applications, and it deeply aids a number of network functions, such as network routing, topology control, coverage, boundary detection, clustering, etc. We investigate a large body of existing localization approaches with focuses on error control and network localizability, the two rising aspects that attract significant research interests in recent years. Error control aims to alleviate the negative impact of noisy ranging measurement and the error accumulation effect during coope- rative localization process. Network localizability provides theoretical analysis on the performance of localization approaches, providing guidance on network configuration and adjustment. We emphasize the basic principles of localization to under- stand the state-of-the-art and to address directions of future research in the new and largely open areas of location-aware technologies.展开更多
This paper deals with the co-design problem of event-triggered communication scheduling and platooning control over vehicular ad-hoc networks(VANETs)subject to finite communication resource.First,a unified model is pr...This paper deals with the co-design problem of event-triggered communication scheduling and platooning control over vehicular ad-hoc networks(VANETs)subject to finite communication resource.First,a unified model is presented to describe the coordinated platoon behavior of leader-follower vehicles in the simultaneous presence of unknown external disturbances and an unknown leader control input.Under such a platoon model,the central aim is to achieve robust platoon formation tracking with desired inter-vehicle spacing and same velocities and accelerations guided by the leader,while attaining improved communication efficiency.Toward this aim,a novel bandwidth-aware dynamic event-triggered scheduling mechanism is developed.One salient feature of the scheduling mechanism is that the threshold parameter in the triggering law is dynamically adjusted over time based on both vehicular state variations and bandwidth status.Then,a sufficient condition for platoon control system stability and performance analysis as well as a co-design criterion of the admissible event-triggered platooning control law and the desired scheduling mechanism are derived.Finally,simulation results are provided to substantiate the effectiveness and merits of the proposed co-design approach for guaranteeing a trade-off between robust platooning control performance and communication efficiency.展开更多
Mobile ad-hoc networks （MANETs） and wireless sensor networks （WSNs） have gained remarkable apprecia- tion and technological development over the last few years. Despite ease of deployment, tremendous applications ...Mobile ad-hoc networks （MANETs） and wireless sensor networks （WSNs） have gained remarkable apprecia- tion and technological development over the last few years. Despite ease of deployment, tremendous applications and significant advantages, security has always been a challeng- ing issue due to the nature of environments in which nodes operate. Nodes＇ physical capture, malicious or selfish behav- ior cannot be detected by traditional security schemes. Trust and reputation based approaches have gained global recog- nition in providing additional means of security for decision making in sensor and ad-hoc networks. This paper provides an extensive literature review of trust and reputation based models both in sensor and ad-hoc networks. Based on the mechanism of trust establishment, we categorize the state- of-the-art into two groups namely node-centric trust mod- els and system-centric trust models. Based on trust evidence, initialization, computation, propagation and weight assign- ments, we evaluate the efficacy of the existing schemes. Fi- nally, we conclude our discussion with identification of some unresolved issues in pursuit of trust and reputation manage- ment.展开更多
Amidst the rapid development of the Internet of Things (loT), Vehicular Ad-Hoc NETwork (VANET), a typical loT application, are bringing an ever-larger number of intelligent and convenient services to the daily lives o...Amidst the rapid development of the Internet of Things (loT), Vehicular Ad-Hoc NETwork (VANET), a typical loT application, are bringing an ever-larger number of intelligent and convenient services to the daily lives of individuals. However, there remain challenges for VANETs in preserving privacy and security. In this paper, we propose the first lattice-based Double-Authentication-Preventing Ring Signature (DAPRS) and adopt it to propose a novel privacy-preserving authentication scheme for VANETs, offering the potential for security against quantum computers. The new construction is proven secure against chosen message attacks. Our scheme is more efficient than other ring signature in terms of the time cost of the message signing phase and verification phase, and also in terms of signature length. Analyses of security and efficiency demonstrate that our proposed scheme is provably secure and efficient in the application.展开更多
Mobile Ad hoc NETwork (MANET) consists of a set of mobile hosts which can operate independently without infrastructure base stations. Energy saving is a critical issue for MANET since most mobile hosts will operate on...Mobile Ad hoc NETwork (MANET) consists of a set of mobile hosts which can operate independently without infrastructure base stations. Energy saving is a critical issue for MANET since most mobile hosts will operate on battery powers. A cross layer coordinated framework for energy saving is proposed in this letter. On-demand power management, physical layer and medium access control layer dialogue based multi-packet reception, mobile agent based topology discovery and topology control based transmit power-aware and battery power-aware dynamic source routing are some of new ideas in this framework.展开更多
Photovoltaic (PV) systems have attracted increasing attention in last years as well as Wireless Sensor Networks (WSNs), which have been used in many application fields. In PV plants, especially in ground installations...Photovoltaic (PV) systems have attracted increasing attention in last years as well as Wireless Sensor Networks (WSNs), which have been used in many application fields. In PV plants, especially in ground installations, a lot of thefts and damages occur due to the still high cost of the modules. A new experimental WSN ad-hoc has been designed to be an anti-theft alarm system. Each node of the network is directly installed under each PV string and it is equipped with an accelerometer sensor capable to detect a minimum displacement of the panel from its steady position. The WSN presents a star topology: a master node cyclically interrogates the slave nodes through RF link. It collects all the nodes responses and communicates though a RS-232 interface with a control PC checking the network status. When a slave node detects an alarm, continuous messages are sent to the control PC which turns on all the alarm signaling systems. The control PC is equipped with an open source operative system and software and provides for SMS, e-mail and sound-light signaling in case of alarm. It also communicates with a remote server where all the WSN information is stored. A first low cost experimental WSN has been already installed and it is working properly.展开更多
On-demand routing protocols are widely used in mobile Ad-hoc network （MANET）. Flooding is an important dissemination scheme in routing discovering of on-demand routing protocol. However, in high-density MANET redund...On-demand routing protocols are widely used in mobile Ad-hoc network （MANET）. Flooding is an important dissemination scheme in routing discovering of on-demand routing protocol. However, in high-density MANET redundancy flooding packets lead to dramatic deterioration of the performance which calls broadcast storm problem （BSP）. A location-aided probabilistic broadcast （LAPB） algorithm for routing in MANET is proposed to reduce the number of routing packets produced by flooding in this paper. In order to reduce the redundancy packets, only nodes in a specific area have the probability, computed by location information and neighbor knowledge, to propagate the routing packets. Simulation results demonstrate that the LAPB algorithm can reduce the packets and discovery delay （DD） in the routing discovery phase.展开更多
Vehicle ad-hoc networks have developed rapidly these years,whose security and privacy issues are always concerned widely.In spite of a remarkable research on their security solutions,but in which there still lacks con...Vehicle ad-hoc networks have developed rapidly these years,whose security and privacy issues are always concerned widely.In spite of a remarkable research on their security solutions,but in which there still lacks considerations on how to secure vehicleto-vehicle communications,particularly when infrastructure is unavailable.In this paper,we propose a lightweight certificateless and oneround key agreement scheme without pairing,and further prove the security of the proposed scheme in the random oracle model.The proposed scheme is expected to not only resist known attacks with less computation cost,but also as an efficient way to relieve the workload of vehicle-to-vehicle authentication,especially in no available infrastructure circumstance.A comprehensive evaluation,including security analysis,efficiency analysis and simulation evaluation,is presented to confirm the security and feasibility of the proposed scheme.展开更多
In order to establish a route supporting multi-constrained quality of service（QoS）, increase network throughput and reduce network energy consumption, an improved ant colony-based multi-constrained QoS energy-saving...In order to establish a route supporting multi-constrained quality of service（QoS）, increase network throughput and reduce network energy consumption, an improved ant colony-based multi-constrained QoS energy-saving routing algorithm（IAMQER） is proposed. The ant colony algorithm, as one of the available heuristic algorithms, is used to find the optimal route from source node to destination node. The proposed IAMQER algorithm, which is based on the analysis of local node information such as node queue length, node forwarding number of data packets and node residual energy, balances the relationship between the network throughput and the energy consumption, thus improving the performance of network in multi-constrained QoS routing. Simulation results show that this IAMQER algorithm can find the QoS route that reduce average energy consumption and improves network packet delivery ratio under the end-to-end delay and packet loss ratio constraints.展开更多
Alerting drivers about incoming emergency vehicles and their routes can greatly improve their travel time in congested cities, while reducing the risk of accidents due to distractions. This paper contributes to this g...Alerting drivers about incoming emergency vehicles and their routes can greatly improve their travel time in congested cities, while reducing the risk of accidents due to distractions. This paper contributes to this goal by proposing Messiah, an Android application capable of informing regular vehicles about incoming emergency vehicles like ambulances, police cars and fire brigades. This is made possible by creating a network of vehicles capable of directly communicating between them. The user can, therefore, take driving decisions in a timely manner by considering incoming alerts. Using the support of our GRCBox hardware, the application can rely on vehicular ad-hoc network communications in the 5 GHz band, being V2V （vehicle-to-vehicle） communication provided through a combination of Android-based smartphone and our GRCBox device. The application was tested in three different scenarios with different levels of obstruction, showing that it is capable of providing alerts up to 300 meters, and notifying vehicles within less than one second.展开更多
Research on ad-hoc network connectivity has mainly focused on asymptotic results in the number of nodes in the network. For a one-dimensional ad-hoc network G1, assuming all the nodes are independently uniform distrib...Research on ad-hoc network connectivity has mainly focused on asymptotic results in the number of nodes in the network. For a one-dimensional ad-hoc network G1, assuming all the nodes are independently uniform distributed in a closed interval [0, Z]（z ∈ R^＋）, we derive a generic formula for the probability that the network is connected. The finite connected ad-hoc networks is analyzed. And we separately suggest necessary conditions to make the ad-hoc network to be connected in one and two dimensional cases, facing possible failed nodes （f-nodes）. Based on the necessary condition and unit-disk assumption for the node transmission, we prove that the nodes of the connected two-dimensional ad-hoc networks （G2） can be divided into at most five different groups. For an f-node no in either of the five groups, we derive a close formula for the probability that there is at least one route between a pair of nodes in G2 -- {no}.展开更多
文摘Location-aware technology spawns numerous unforeseen pervasive applications in a wide range of living, pro- duction, commence, and public services. This article provides an overview of the location, localization, and localizability issues of wireless ad-hoc and sensor networks. Making data geographically meaningful, location information is essential for many applications, and it deeply aids a number of network functions, such as network routing, topology control, coverage, boundary detection, clustering, etc. We investigate a large body of existing localization approaches with focuses on error control and network localizability, the two rising aspects that attract significant research interests in recent years. Error control aims to alleviate the negative impact of noisy ranging measurement and the error accumulation effect during coope- rative localization process. Network localizability provides theoretical analysis on the performance of localization approaches, providing guidance on network configuration and adjustment. We emphasize the basic principles of localization to under- stand the state-of-the-art and to address directions of future research in the new and largely open areas of location-aware technologies.
基金This work was supported in part by the Australian Research Council Discovery Early Career Researcher Award under Grant DE200101128.
文摘This paper deals with the co-design problem of event-triggered communication scheduling and platooning control over vehicular ad-hoc networks(VANETs)subject to finite communication resource.First,a unified model is presented to describe the coordinated platoon behavior of leader-follower vehicles in the simultaneous presence of unknown external disturbances and an unknown leader control input.Under such a platoon model,the central aim is to achieve robust platoon formation tracking with desired inter-vehicle spacing and same velocities and accelerations guided by the leader,while attaining improved communication efficiency.Toward this aim,a novel bandwidth-aware dynamic event-triggered scheduling mechanism is developed.One salient feature of the scheduling mechanism is that the threshold parameter in the triggering law is dynamically adjusted over time based on both vehicular state variations and bandwidth status.Then,a sufficient condition for platoon control system stability and performance analysis as well as a co-design criterion of the admissible event-triggered platooning control law and the desired scheduling mechanism are derived.Finally,simulation results are provided to substantiate the effectiveness and merits of the proposed co-design approach for guaranteeing a trade-off between robust platooning control performance and communication efficiency.
文摘Mobile ad-hoc networks （MANETs） and wireless sensor networks （WSNs） have gained remarkable apprecia- tion and technological development over the last few years. Despite ease of deployment, tremendous applications and significant advantages, security has always been a challeng- ing issue due to the nature of environments in which nodes operate. Nodes＇ physical capture, malicious or selfish behav- ior cannot be detected by traditional security schemes. Trust and reputation based approaches have gained global recog- nition in providing additional means of security for decision making in sensor and ad-hoc networks. This paper provides an extensive literature review of trust and reputation based models both in sensor and ad-hoc networks. Based on the mechanism of trust establishment, we categorize the state- of-the-art into two groups namely node-centric trust mod- els and system-centric trust models. Based on trust evidence, initialization, computation, propagation and weight assign- ments, we evaluate the efficacy of the existing schemes. Fi- nally, we conclude our discussion with identification of some unresolved issues in pursuit of trust and reputation manage- ment.
基金supported by the National Key R&D(973)Program of China(No.2017YFB0802000)the National Natural Science Foundation of China(Nos.61772326,61572303,61872229,and 61802239)+4 种基金the NSFC Research Fund for International Young Scientists(No.61750110528)the National Cryptography Development Fund during the 13th Five-Year Plan Period(Nos.MMJJ20170216 and MMJJ201701304)the Foundation of State Key Laboratory of Information Security(No.2017-MS-03)the Fundamental Research Funds for the Central Universities(No.GK201702004,GK201803061,and 2018CBLY006)the China Postdoctoral Science Foundation(No.2018M631121)
文摘Amidst the rapid development of the Internet of Things (loT), Vehicular Ad-Hoc NETwork (VANET), a typical loT application, are bringing an ever-larger number of intelligent and convenient services to the daily lives of individuals. However, there remain challenges for VANETs in preserving privacy and security. In this paper, we propose the first lattice-based Double-Authentication-Preventing Ring Signature (DAPRS) and adopt it to propose a novel privacy-preserving authentication scheme for VANETs, offering the potential for security against quantum computers. The new construction is proven secure against chosen message attacks. Our scheme is more efficient than other ring signature in terms of the time cost of the message signing phase and verification phase, and also in terms of signature length. Analyses of security and efficiency demonstrate that our proposed scheme is provably secure and efficient in the application.
基金863" Project Fund (No.2002AA121068) National Natural Science Foundation of China(No.60272066)
文摘Mobile Ad hoc NETwork (MANET) consists of a set of mobile hosts which can operate independently without infrastructure base stations. Energy saving is a critical issue for MANET since most mobile hosts will operate on battery powers. A cross layer coordinated framework for energy saving is proposed in this letter. On-demand power management, physical layer and medium access control layer dialogue based multi-packet reception, mobile agent based topology discovery and topology control based transmit power-aware and battery power-aware dynamic source routing are some of new ideas in this framework.
文摘Photovoltaic (PV) systems have attracted increasing attention in last years as well as Wireless Sensor Networks (WSNs), which have been used in many application fields. In PV plants, especially in ground installations, a lot of thefts and damages occur due to the still high cost of the modules. A new experimental WSN ad-hoc has been designed to be an anti-theft alarm system. Each node of the network is directly installed under each PV string and it is equipped with an accelerometer sensor capable to detect a minimum displacement of the panel from its steady position. The WSN presents a star topology: a master node cyclically interrogates the slave nodes through RF link. It collects all the nodes responses and communicates though a RS-232 interface with a control PC checking the network status. When a slave node detects an alarm, continuous messages are sent to the control PC which turns on all the alarm signaling systems. The control PC is equipped with an open source operative system and software and provides for SMS, e-mail and sound-light signaling in case of alarm. It also communicates with a remote server where all the WSN information is stored. A first low cost experimental WSN has been already installed and it is working properly.
基金supported by the National Natural Science Foundation of China (61272450,61662013,U1501252)the Guangxi Natural Science Foundation (2014GXNSFDA118036)+1 种基金the High Level of Innovation Team of Colleges and Universities in GuangxiOutstanding Scholars Program Funding
文摘On-demand routing protocols are widely used in mobile Ad-hoc network （MANET）. Flooding is an important dissemination scheme in routing discovering of on-demand routing protocol. However, in high-density MANET redundancy flooding packets lead to dramatic deterioration of the performance which calls broadcast storm problem （BSP）. A location-aided probabilistic broadcast （LAPB） algorithm for routing in MANET is proposed to reduce the number of routing packets produced by flooding in this paper. In order to reduce the redundancy packets, only nodes in a specific area have the probability, computed by location information and neighbor knowledge, to propagate the routing packets. Simulation results demonstrate that the LAPB algorithm can reduce the packets and discovery delay （DD） in the routing discovery phase.
基金This work was supported in part by the National Natural Science Foundation of China under Grant No.61170217,61272469,61303212,61332019,and Grant No.U1135004,and by the Fundamental Research Founds for National University,China University of Geosciences
文摘Vehicle ad-hoc networks have developed rapidly these years,whose security and privacy issues are always concerned widely.In spite of a remarkable research on their security solutions,but in which there still lacks considerations on how to secure vehicleto-vehicle communications,particularly when infrastructure is unavailable.In this paper,we propose a lightweight certificateless and oneround key agreement scheme without pairing,and further prove the security of the proposed scheme in the random oracle model.The proposed scheme is expected to not only resist known attacks with less computation cost,but also as an efficient way to relieve the workload of vehicle-to-vehicle authentication,especially in no available infrastructure circumstance.A comprehensive evaluation,including security analysis,efficiency analysis and simulation evaluation,is presented to confirm the security and feasibility of the proposed scheme.
基金supported by the National Natural Science Foundation of China(61101107)the Beijing Higher Education Young Elite Teacher Project
文摘In order to establish a route supporting multi-constrained quality of service（QoS）, increase network throughput and reduce network energy consumption, an improved ant colony-based multi-constrained QoS energy-saving routing algorithm（IAMQER） is proposed. The ant colony algorithm, as one of the available heuristic algorithms, is used to find the optimal route from source node to destination node. The proposed IAMQER algorithm, which is based on the analysis of local node information such as node queue length, node forwarding number of data packets and node residual energy, balances the relationship between the network throughput and the energy consumption, thus improving the performance of network in multi-constrained QoS routing. Simulation results show that this IAMQER algorithm can find the QoS route that reduce average energy consumption and improves network packet delivery ratio under the end-to-end delay and packet loss ratio constraints.
文摘Alerting drivers about incoming emergency vehicles and their routes can greatly improve their travel time in congested cities, while reducing the risk of accidents due to distractions. This paper contributes to this goal by proposing Messiah, an Android application capable of informing regular vehicles about incoming emergency vehicles like ambulances, police cars and fire brigades. This is made possible by creating a network of vehicles capable of directly communicating between them. The user can, therefore, take driving decisions in a timely manner by considering incoming alerts. Using the support of our GRCBox hardware, the application can rely on vehicular ad-hoc network communications in the 5 GHz band, being V2V （vehicle-to-vehicle） communication provided through a combination of Android-based smartphone and our GRCBox device. The application was tested in three different scenarios with different levels of obstruction, showing that it is capable of providing alerts up to 300 meters, and notifying vehicles within less than one second.
基金the National Natural Science Foundation of China (Grant No. 60572066)Key Scientific Research Project of Shanghai Municipal Education Commission (Grant No. 06ZZ84)CityU, Hong Kong, Applied R & D Funding (ARD) (Grant No. 9668009)
文摘Research on ad-hoc network connectivity has mainly focused on asymptotic results in the number of nodes in the network. For a one-dimensional ad-hoc network G1, assuming all the nodes are independently uniform distributed in a closed interval [0, Z]（z ∈ R^＋）, we derive a generic formula for the probability that the network is connected. The finite connected ad-hoc networks is analyzed. And we separately suggest necessary conditions to make the ad-hoc network to be connected in one and two dimensional cases, facing possible failed nodes （f-nodes）. Based on the necessary condition and unit-disk assumption for the node transmission, we prove that the nodes of the connected two-dimensional ad-hoc networks （G2） can be divided into at most five different groups. For an f-node no in either of the five groups, we derive a close formula for the probability that there is at least one route between a pair of nodes in G2 -- {no}.
