The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Underwater acoustic sensor networks (UASNs) are widely used in many application. However, the underwater acoustic channel poses many challenges for reliable data transmission protocol design. In this paper, we propose a new data transmission protocol based on Fountain codes and Selective-repeat ARQ scheme (FSR-ARQ). The new approach utilizes the packet error correction ability of rateless code and...
Internet of things (IoT) is a quickly rising paradigm that covers an important set of technologies that are expected to be the next information revolution. IoT is closely connected with people, therefore privacy and security are major issues. In this paper, we summarize current open challenges and present our position on future research directions. We suggest to borrow the "peer approval"...
In this paper, we present a two-party identity-based authenticated key exchange protocol from lattice. We prove the security of our scheme under the LWE assumption, without random oracle, in the CK model.
In this paper, we present a two-party attribute-based authenticated key exchange scheme for a wide class of relations, which are specified by non-monotone access structures combined with inner-produce relations. We prove the security of our scheme under the decisional linear (DLIN) assumption, without random oracle, in our ABCK model, which is a natural extension of the CK model.
Commitment schemes are fundamental building blocks in cryptography, and have wide applications in constructing various protocols. Non-malleable commitment considers concurrent executions of a commitment scheme against a man-in-the-middle adversary. In this paper, we investigate non-malleability of statistically hiding commitment schemes, and present the first concurrent non-malleable statistically...
For communications and networking channels, coding techniques are widely used to correct errors in corrupted messages. The “Quality of Protection” (QoP) that can be provided via error correction directly affects the “Quality of Service” (QoS) experienced by users. The errors are commonly assumed to be substitution or erasure errors. Such systems rely on perfect synchronization so that no bit is deleted...
In wireless sensor networks (WSNs), coverage is a key factor of affection the lifetime of networks. In this paper, we study the coverage problem for network which is comprised of mobile sensor nodes with sensing radius r and communication radius R = 2r. For a possible movable redundant sensor, we present a coverage hole detection method (CHDM) by mathematic analysis, and then give a node mobility...
In this paper, we present a two-party identity-based key agreement protocol, which is provably secure without random oracles under three static assumptions. It is inspired on a new identity-based encrypt system proposed in TCC 2010 by Lewko and Waters. We show how this key agreement can be used in either escrowed or escrowless mode. We also modify the protocol in the escrow to provide perfect forward...
This paper presents an optimistic fair exchange protocol based on public verifiable secret sharing for e-procurement applications in Peer-2-Peer networks. According to the decentralized feature of such a network, a distributed third party is designed to guarantee the fairness of exchange. Comparing to traditional trusted third party, this distributed third party is not fixed but dynamically selected...
Recently, the notion of asymmetric group key agreement (ASGKA) was introduced, in which the group members merely negotiate a common encryption key which is accessible to any entity, but they hold respective secret decryption keys. In this paper, we propose an ASGKA protocol with traitor traceability. The new scheme achieves most of known security attributes, such as session key secrecy, known-key...
As the wireless network scales up in size and complexity, the need to study the scalability and behaviors of these networks and their protocols becomes essential. Opportunistic routing utilizes broadcast nature of wireless network, and significantly increases the unicast throughput. However, all of the current opportunistic routing protocols have to rely on the whole topology information. This indeed...
We consider a Decoded-and-Forward (DF) cooperative relaying network without a direct link. We investigate the outage probability (OP) of cooperation systems with either a DF scheme or a Selective DF (S-DF) scheme when relay channels experience statistically different Rayleigh fading. In the case of the DF system, an upper and lower bound of the OP are established to show the asymptotic performance...
A practical scenario to realize Ad hoc network based on the Linux operation system is proposed in this paper. A practical test network composed of several nodes is built and DSR (Dynamic Source Routing) protocol is selected to run on the test network. Meanwhile, in order to obtain better support for real time multimedia services, an improved DSR protocol considering delay demand is also testified...
Cluster-based routing protocol is currently a hot research in wireless sensor network. In this paper, we propose an improved method RECHS(Redundant and Energy-efficient Clusterhead Selection) for LEACH protocol to balance network load and to extend the network life. In order to selecting reasonable clusterheads, our scheme first selects initial clusterheads and initial redundant clusterheads. By comparing...
The lifetime maximization routing with network coding in wireless multihop networks is considered in this paper. The problems is formulated in three different cases: (i) no network coding, (ii) two-way network coding, and (iii) overhearing network coding. Flow augmenting routing (FA) is used to solve the first case, and then it is extended to FA with network coding (FANC) for the latter two. The performance...
Fast handover protocol provides seamless handover in mobile IPv6 networks by reducing handover latency. One assumption in fast handover is that the MN (Mobile Node) or the network could know or predict the new AR (Access Router) before data transport from the previous AR to the MN is disrupted. In order to achieve this capability, the complexity of predicting the new AR and the diversity of the wireless...
This paper describes an on-line monitor system based on wireless sensor networks, which could test the ingredients of vehicles' off-gases, and also introduces the design of the hardware and software in details, and transplants the Zigbee protocol on the system at last. With the character of portability and the high precision gas sensors, the system could monitor the off-gases and distinguish the ingredients...
In this paper, we present a two-party attribute-based key agreement protocol, which is secure in random oracle model under the Bilinear Diffe-Hellman assumption. It is inspired by a fuzzy identity-based encryption scheme first proposed by Sahai and Waters. The attribute-based key agreement scheme is a new type of identity-based key agreement scheme, in which we can view identity as a set of descriptive...
Directional antennas in Ad hoc networks offer more benefits than the traditional antennas with omni-directional mode. With directional antennas, it can increase the spatial reuse of the wireless channel. A higher gain of directional antennas makes terminals a further transmission range and fewer hops to the destination. This paper presents the design, implementation and simulation results of a multi-channel...
Modern software model checkers are usually used to find safety violations. However, checking liveness properties can offer a more natural and effective way to detect errors, particularly in complex concurrent and distributed e-business systems. Specifying global liveness properties which should always eventually be true proves to be more desirable, but it is hard for existing software model checkers...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.