Opportunistic Localization Scheme Based on Linear Matrix Inequality

Enabling self-localization of mobile nodes is an important problem that has been widely studied in the literature. The general conclusions is that an accurate localization requires either sophisticated hardware (GPS, UWB, ultrasounds transceiver) or a dedicated infrastructure (GSM, WLAN). In this paper we tackle the problem from a different and rather new perspective: we investigate how localization performance can be improved by means of a cooperative and opportunistic data exchange among the nodes. We consider a target node, completely unaware of its own position, and a number of mobile nodes with some self-localization capabilities. When the opportunity occurs, the target node can exchange data with in-range mobile nodes. This opportunistic data exchange is then used by the target node to refine its position estimate by using a technique based on Linear Matrix Inequalities and barycentric algorithm. To investigate the performance of such an opportunistic localization algorithm, we define a simple mathematical model that describes the opportunistic interactions and, then, we run several computer simulations for analyzing the effect of the nodes duty-cycle and of the native self-localization error modeling considered. The results show that the opportunistic interactions can actually improve the self-localization accuracy of a strayed node in many different scenarios

Cryptanalysis of an Efficient Signcryption Scheme with Forward Secrecy Based on Elliptic Curve

The signcryption is a relatively new cryptographic technique that is supposed to fulfill the functionalities of encryption and digital signature in a single logical step. Several signcryption schemes are proposed throughout the years, each of them having its own problems and limitations. In this paper, the security of a recent signcryption scheme, i.e. Hwang et al.'s scheme is analyzed, and it is proved that it involves several security flaws and shortcomings. Several devastating attacks are also introduced to the mentioned scheme whereby it fails all the desired and essential security attributes of a signcryption scheme.Comment: 5 Pages, 2 Figure

LPKI - A Lightweight Public Key Infrastructure for the Mobile Environments

The non-repudiation as an essential requirement of many applications can be provided by the asymmetric key model. With the evolution of new applications such as mobile commerce, it is essential to provide secure and efficient solutions for the mobile environments. The traditional public key cryptography involves huge computational costs and is not so suitable for the resource-constrained platforms. The elliptic curve-based approaches as the newer solutions require certain considerations that are not taken into account in the traditional public key infrastructures. The main contribution of this paper is to introduce a Lightweight Public Key Infrastructure (LPKI) for the constrained platforms such as mobile phones. It takes advantages of elliptic curve cryptography and signcryption to decrease the computational costs and communication overheads, and adapting to the constraints. All the computational costs of required validations can be eliminated from end-entities by introduction of a validation authority to the introduced infrastructure and delegating validations to such a component. LPKI is so suitable for mobile environments and for applications such as mobile commerce where the security is the great concern.Comment: 6 Pages, 6 Figure

Performance Model for a Conservative Distributed Simulation Environment Using Null Messages to Avoid Deadlock

A conservative distributed simulation requires all logical processes (LPs) to follow the causality constraint requirement. This implies that all event-messages are processed in strictly timestamp order. Apart from the timestamp of each event generated by LPs, synchronization between all LPs is the second most important requirements. Finally, there must not be a deadlock in the distributed environment. A deadlock may occur when there is no events present in the queue of LP. In such case, to avoid deadlock, Chandy-Misra-Bryant presented an algorithm called Null Message Algorithm (NMA) [3]. These null messages are passed as an event-message to other LPs and it stored in one of queues of LPs. This null message indicates that till the time stamp of that null message, all other events in the queue which have lesser time stamp than null message’s time stamp are safe to process. It means that there won’t be any arrival of any events from that logical process until current simulation time is equal to the time stamp of the null message. With the time stamp of the null message, a Lookahead value is added to the time stamp of that null message. This Lookahead value can be measure on certain kind of parameters such as delay to transmit a message, propagation delay, etc. therefore, calculating value of Lookahead is the most important part as Lookahead value affects the performance of the conservative distributed event simulation. Proper value of Lookahead can reduce the number of null messages which decreases the traffic of the network. In this paper, we demonstrate some calculation on the Lookahead which shows the performance of the distributed event simulation

Link quality based EDCA MAC protocol for WAVE vehicular networks

The WAVE vehicular networks adopt the Enhanced Distributed Channel Access (EDCA) as the MAC layer protocol. In EDCA, different values of arbitrary inter-frame space (AIFS) can be used for different classes of traffic. The smaller the AIFS value is, the higher the priority a device has in accessing the shared channel. In this paper, we exploit the possibility of assigning the AIFS values according to channel/link quality. Notably a device with better link quality can transmit at a higher data rate. Therefore, our key objective is to maximize the system throughput between a roadside unit (RSU) and the onboard units (OBUs) passed by. Since IEEE 802.11p supports eight transmission rates, two schemes for mapping AIFS values to transmission rates are studied. The first one (8-level-AIFS) uses eight distinct AIFS values, one for each transmission rate. And the second one (4-level-AIFS) uses four distinct AIFS values, one for every two adjacent transmission rates. Their throughput performances are studied by simulations. It is interesting to note that OBUs tend to experience the same pattern of channel quality fluctuation, due to the similar vehicle moving pattern. To this end, assigning AIFS values according to link quality is fair. © 2013 IEEE.published_or_final_versio

The state of peer-to-peer network simulators

Networking research often relies on simulation in order to test and evaluate new ideas. An important requirement of this process is that results must be reproducible so that other researchers can replicate, validate and extend existing work. We look at the landscape of simulators for research in peer-to-peer (P2P) networks by conducting a survey of a combined total of over 280 papers from before and after 2007 (the year of the last survey in this area), and comment on the large quantity of research using bespoke, closed-source simulators. We propose a set of criteria that P2P simulators should meet, and poll the P2P research community for their agreement. We aim to drive the community towards performing their experiments on simulators that allow for others to validate their results

A Cyber Physical Systems Perspective on the Real-time and Reliable Dissemination of Information in Intelligent Transportation Systems

Timely and reliable dissemination of traffic-related information to drivers is a key property that intelligent transportation systems (ITS) should support. Numerous impediments stemming due to (a) physical factors, such as mobility and speed of vehicles, density of vehicles, characteristics of the wireless radio channel, and power and bit rate of radio transceivers, and (b) cyber issues, such as MAC layer access point associations and address resolutions (ARP), network layer addressing, routing and handoffs, and transport layer retransmissions lead to unpredictability in the timely and reliable dissemination of information to drivers. This paper presents compelling arguments in favor of new research directions in this area that are based on a cyber-physical systems (CPS) perspective. In particular, this paper makes three contributions. First, it considers a vehicle-centric perspective to survey and study the physics-and cyber-imposed impediments to the timely and reliable dissemination of information. Second, it presents a promising CPS solution to overcome a subset of the impediments discovered. Third, it outlines lessons learned indicating the need for more focused research and realistic testbeds. The evaluations 1 www.macrothink.org/npa Network Protocols and Algorithm

Handover based IMS registration scheme for next generation mobile networks

Next generation mobile networks aim to provide faster speed and more capacity along with energy efficiency to support video streaming and massive data sharing in social and communication networks. In these networks, user equipment has to register with IPMultimedia Subsystem (IMS) which promises quality of service to the mobile users that frequently move across different access networks. After each handover caused due to mobility, IMS provides IPSec Security Association establishment and authentication phases. The main issue is that unnecessary reregistration after every handover results in latency and communication overhead. To tackle these issues, this paper presents a lightweight Fast IMS Mobility (FIM) registration scheme that avoids unnecessary conventional registration phases such as security associations, authentication, and authorization. FIM maintains a flag to avoid deregistration and sends a subsequent message to provide necessary parameters to IMS servers after mobility. It also handles the change of IP address for user equipment and transferring the security associations from old to new servers.We have validated the performance of FIM by developing a testbed consisting of IMS servers and user equipment. The experimental results demonstrate the performance supremacy of FIM. It reduces media disruption time, number of messages, and packet loss up to 67%, 100%, and 61%, respectively, as compared to preliminaries. © 2017 Shireen Tahira et al