Search

Very low frequency electromagnetic communication system is used in a small scale underwater wireless sensor network for coastal monitoring purposes, as recent research has demonstrated distinct advantages of radio waves compared to acoustic and optical waves in shallow water conditions. This paper describes the detailed TDMA and packet design process for the prototype sensor system. The lightweight protocol is time division based in order to fit the unique characteristics and specifications of the network. Evaluations are based on initial beach trial as well as modeling and simulations.

Security counts as a critical barrier to continuing growth of RFID industry due to lack of a proper high performance lightweight protocol-based solution. Amongst recent developments the Fast Lightweight Mutual Authentication Protocol (FLMAP) has been accepted for its superior speed and low complexity features. Here we examine the security strengths of FLMAP through systematic cryptanalysis tests. Outcome of our investigation show that in spite of its superior speed and power saving features FLMAP shows some serious design gaps and shortfalls against two specifically selected desynchronization and ID disclosure attacks. Finally, we propose solutions to fix the FLMAP designing and security flaws.

Proactive or time-driven sensor networks are devoted to the continuous reporting of environmental data to a sink or base station. An important issue associated with these networks is the management of a potentially large number of packets that are regularly generated by the set of nodes. A common solution at the MAC level is to use scheduled TDMA-based protocols, which minimize the communication duty cycle. However, TDMA schemes have strong synchronization requirements and exhibit low adaptability to changing traffic conditions. Thus, this paper proposes an alternative MAC protocol that overcomes the limitations of TDMA-based protocols while still approaching their performance in terms of lifetime. Essentially, this proposed solution combines randomization of the sensing and transmission process with a mechanism based on transmission announcements between adjacent nodes. The result is a lightweight protocol, called Randomized Data-Gathering (RDG), which exhibits desirable characteristics with respect to energy efficiency, synchronization avoidance, performance, scalability and adaptability to traffic changes in both time and space. The role of the randomization distribution is considered in detail, and an effective randomization scheme is selected. Both analytical and simulation methods are applied.

E-textile technology has earned a great deal of interest in many fields; however, existing wearable network protocols are not optimized for use with conductive yarn. In this paper, some of the basic properties of conductive textiles and requirements on wearable personal area networks (PANs) are reviewed. Then, we present a wearable personal network (WPN), which is a four-layered wearable PAN using bus topology. We have designed the WPN to be a lightweight protocol to work with a variety of microcontrollers. The profile layer is provided to make the application development process easy. The data link layer exchanges frames in a master-slave manner in either the reliable or best-effort mode. The lower part of the data link layer and the physical layer of WPN are made of a fabric serial-bus interface which is capable of measuring bus signal properties and adapting to medium variation. After a formal verification of operation and performances of WPN, we implemented WPN communication modules (WCMs) on small flexible printed circuit boards. In order to demonstrate the behavior of our WPN on a textile, we designed a WPN tutorial shirt prototype using implemented WCMs and conductive yarn.

The protocol allows a content provider to detect duplicate copy of a digital content and restrict the content provider who blames the innocent customer. This paper, proposed a lightweight protocol, which uses composite signal representation and time-stamping for watermark embedding and extraction. We have used timestamp, which tells at what time the digital content was created, signed or verified to digital watermarking algorithms and uses the composite signal representation for minimizing the overhead and bandwidth due to the use of composite signals. The suggested protocol uses composite signal representations and timestamp based methods with digital watermarking scheme for content authentication. Our watermark embedding and detection algorithm achieves a balance between robustness and image visual quality. Simulation results demonstrate that the algorithm used by proposed protocol has an increase robustness and good quality of watermark images as well and withstand against various image-processing attacks.

Sensor networks enable a wide range of applications in both military and civilian domains. However, the deployment scenarios, the functionality requirements, and the limited capabilities of these networks expose them to a wide range of attacks against control traffic (such as wormholes, rushing, Sybil attacks, etc.) and data traffic (such as selective forwarding). In this paper we propose a framework called UnMask that mitigates such attacks by detecting, diagnosing, and isolating the malicious nodes. UnMask uses as a fundamental building block the ability of a node to oversee its neighboring nodes' communication. On top of UnMask, we build a secure routing protocol, Lsr, that provides additional protection against malicious nodes by supporting multiple node-disjoint paths. We analyze the security guarantees of UnMask and use ns-2 simulations to show its effectiveness against representative control and data attacks. The overhead analysis we present shows that UnMask is a lightweight protocol appropriate for securing resource constrained sensor networks.

Lightweight protocols are an important topic in the area of computer communications. With the proliferation of security services not only ordinary communication protocols, but also cryptographic protocols, i.e. security services, have become a subject of research into possible appropriate lightweight solutions. At first glance it may seem surprising, but the evidence suggests that there is a permanent need for lightweight protocols. And this need is ever increasing, due to the gap between desktop (and other ordinary computing devices) and mobile wireless devices that have inherently limited resources. However, the notion of lightweight protocol has not been formally addressed in the literature, which is the purpose of this paper. A formal model that can be used to evaluate lightweight properties of protocols is presented and the appropriate metrics are introduced. Despite the fact that the model and the metrics target weak processing devices, they can be deployed for ordinary computing environments and may present a methodology for evaluation of lightweight cryptographic protocols in standardization processes.

As low-cost RFIDs with limited resources will dominate most of the RFID market, it is imperative to design lightweight RFID authentication protocols for these low-cost RFIDs. However, most of existing RFID authentication protocols either suffer from some security weaknesses or require costly operations that are not available on low-cost tags. In this paper, we analyze the security vulnerabilities of a lightweight authentication protocol recently proposed by Li et al. (2006), and then propose a new lightweight protocol to improve the security and to reduce the computational cost for identifying a tag from O(n) to O(1).

We propose Adaptive Backbone Protocol ABP, a lightweight protocol for distributed formation of a backbone over Heterogeneous Wireless Networks. ABP does not require any neighborhood information and consequently scales well with the number of nodes and network size. We present an analytical framework to study the performance of ABP. By making the nodes rotate the role of backbone nodes, we extend the life of the network.

We present the Lightning Protocol, a hard real-time, fast, and lightweight protocol to elect the sensor closest to an impulsive sound source. This protocol can serve proximity-based localization or leader election for sensor collaboration. It utilizes the fact that electromagnetic waves propagate much faster than acoustic waves to efficiently reduce the number of contending sensors in the election. With simple RF bursts, most basic comparison operations, no need of clock synchronization, and a memory footprint as small as 5,330 bytes of ROM and 187 bytes of RAM, the protocol incurs O(1) transmissions, irrespective of the sensor density, and guarantees hard real-time (O(1)) localization time cost. Experiment results using UC Berkeley Motes in a common office environment demonstrate that the time delay for the Lightning Protocol is on the order of milliseconds. The simplicity of the protocol reduces memory cost, computation complexity, and programming difficulty, making it desirable for low-end wireless sensors.

As pervasive computing technologies develop fast, the privacy protection becomes a crucial issue and needs to be coped with very carefully. Typically, it is difficult to efficiently identify and manage plenty of the low-cost pervasive devices like Radio Frequency Identification Devices (RFID), without leaking any privacy information. In particular, the attacker may not only eavesdrop the communication in a passive way, but also mount an active attack to ask queries adaptively, which is obviously more dangerous. Towards settling this problem, in this paper, we propose two lightweight authentication protocols which are privacy-preserving against active attack, in an asymmetric way. That asymmetric style with privacy-oriented simplification succeeds to reduce the load of low-cost devices and drastically decrease the computation cost for the management of server. This is because that, unlike the usual management of the identities, our approach does not require any synchronization nor exhaustive search in the database, which enjoys great convenience in case of a large-scale system. The protocols are based on a fast asymmetric encryption with specialized simplification and only one cryptographic hash function, which consequently assigns an easy work to pervasive devices. Besides, our results do not require the strong assumption of the random oracle.

In this paper, we propose a lightweight management protocol for IPv6-based wireless sensor networks (WSNs). IPv6-based WSNs use large numbers of battery-operated devices with limited computing and energy resources. Network performance is influenced by link quality and energy resources of node devices and node failure in networks may affect the end-to-end communications. Thus real-time network management is important for the network performance. To meet the demands of the management service in resource limited WSNs and the real-time network management requirements of local area networks, an interactive communication model and a management information base (MIB) for device are firstly designed. Then we develop common and unified access methods for management objects and attributes, and specifically, to realize the management of frequently-used attributes, specific command frames are proposed. Compared to the traditional management protocols, the proposed lightweight protocol reduces the management packet length, consumes less energy and saves code space. Test results show that the protocol runs well in the practical IPv6-based WSNs and manages devices effectively.

Most electric power companies employs power meter reader to collect data on the customer's energy consumption. Usually, this task is carried out manually, which can lead to high cost and errors, causing financial losses. Some approaches trying to minimize these problems, such as: discover the minimal route or use a car to perform the readings. However, errors associated the manual readings can still occurs and cars suffer with congestions and a high costs of the fuel consumption and to maintaining. In this work, we go further and propose an architecture to Automatic Meter Reading (AMR) system using Unmanned Aerial Vehicles (UAV). The main challenge of the solution is design a robust and lightweight protocol that is able to deal with the wireless communication collisions. Therefore, the main contribution of this work is the design a new protocol to ensure wireless communication from UAV to the power meters. We validated and evaluated the architecture in an urban scenario and the results show a decrease of time and distance respectively when compared to car approach. Our collision mechanism reaches an improved of 98% in reducing the messages collisions.

RFID facilitates automatic identification, tracking, and handling of objects, human beings, and animals through the use of radio-frequency based communications. The performance of RFID depends on tag, reader, and server equipment that make use of radio waves in order to establish communications between each other. The economic transfers are among the primary objectives of RFID, though these days, other sectors within the industry benefit from it. Nonetheless, the major concern in RFID systems relates to their security and privacy. Up to now, several protocols have been introduced on tag and reader identification but the majority of them suffer from shortcomings. In 2012, Doss et al. proposed a lightweight protocol based on minimum disclosure that guaranteed the safety of communications between tag-reader and reader-server channels. In the current study, it has been shown that this protocol is prone to replay attack. In other words, attackers can authenticate themselves to the server as a legal reader or a legal tag. Therefore, an improvement has been proposed in the current article to make the protocol more resistant against attacks.

Secure yet lightweight protocol for communication over the Internet is a pertinent problem for constrained environments in the context of Internet of Things (IoT) / Machine to Machine (M2M) applications. This paper extends the initial approaches published in [1], [2] and presents a novel cross-layer lightweight implementation to establish a secure channel. It distributes the responsibility of communication over secure channel in between the application and transport layers. Secure session establishment is performed using a payload embedded challenge response scheme over the Constrained Application Protocol (CoAP) [3]. Record encryption mechanism of Datagram Transport Layer Security (DTLS) [4] with Pre-Shared Key (PSK) [5] is used for encrypted exchange of application layer data. The secure session credentials derived from the application layer is used for encrypted exchange over the transport layer. The solution is designed in such a way that it can easily be integrated with an existing system deploying CoAP over DTLS-PSK. The proposed method is robust under different security attacks like replay attack, DoS and chosen cipher text. The improved performance of the proposed solution is established with comparative results and analysis.

Nowadays, mobile phones are equipped with enhanced short-range communication functionality called Near Field Communication (or NFC for short). NFC requires no pairing between devices and suitable for transferring small amount of data in very limited area. A number of researchers proposed authentication techniques for NFC communications but they still lack some necessary security properties, especially mutual authentication‥ This paper introduces new authentication protocols for NFC communication that provides mutual authentication between connecting devices. Mutual authentication is a security property that prevents replay and man-in-the-middle attack. The proposed protocols deploy limited-use offline session key generation and distribution technique to enhance security and importantly make our protocol lightweight.

Wireless Sensor Networks are being widely used in many real time applications that require continuous monitoring and maintenance of surroundings and their environment. Communication is a vital operation in WSN and most of the times the data is confidential. Hence, security of data is a major concern in WSN and it has been observed that a secure authentication mechanism will ensure confidentiality and integrity of data in WSN. Many authentication mechanisms have been designed but most of them require the sensor nodes to have much computational resources, involves much communication and storage overheads and are quite complex. In this paper, we propose a simple, secure, dynamic, scalable, efficient and lightweight protocol for mutual authentication of nodes in WSN. The protocol is based on tokens, each sensor node acquires a token from base station (BS) and later on without any involvement of BS sensor nodes mutually authenticate each other using acquired tokens. The proposed protocol was modeled in scyther for verification and no potential attacks were detected.

Radio Frequency Identification (RFID) technology is rapidly making its way to next generation automatic identification systems. Despite encouraging prospects of RFID technology, security threats and privacy concerns limit its widespread deployment. Security in passive RFID tag based systems is a challenge owing to the severe resource restrictions. In this paper, we present a lightweight anonymity / mutual authentication protocol that uses a unique choice of pseudorandom numbers to achieve basic security goals, i.e. confidentiality, integrity and authentication. We validate our protocol by security analysis.

We present a communication protocol with encryption, suitable for extremely weak devices, which communicate only by sending un-modulated, on/off signals beeping. We assume severely constrained model with no coordination or synchronization between devices, and no mechanism for message reception acknowledgement. Under these assumptions, we present a way to handle the problem of transmissions interference collisions and providing message secrecy at the same time. In order to achieve our goals in such a limited communication channel, we use special encoding and combine encryption procedure with the communication layer of the protocol. This is different from the state-of-the-art-today, where an encrypted channel is built in the highest level of the communication protocol after assigning the radio channel to one of the sender devices. We present a real-life motivations for the proposed approach as well as rigid correctness and security analysis.

Generally, resource-awareness plays a key role in wireless sensor networks due the limited capabilities in processing, storage and communication. In this paper we present a resource-aware cooperative state estimation facilitated by a dynamic cluster-based protocol in a visual sensor network (VSN). The VSN consists of smart cameras, which process and analyze the captured data locally. We apply a state estimation algorithm to improve the tracking results of the cameras. To design a lightweight protocol, the final aggregation of the observations and state estimation are only performed by the cluster head. Our protocol is based on a marketbased approach in which the cluster head is elected based on the available resources and a visibility parameter of the object gained by the cluster members. We show in simulations that our approach reduces the costs for state estimation and communication as compared to a fully distributed approach. As resource-awareness is the focus of the cluster-based protocol we can accept a slight degradation of the accuracy on the object’s state estimation by a standard deviation of about 1.48 length units to the available ground truth.

The Internet of Things (IoT) paradigm allows small and resource constrained devices to send data through complex networks like the Internet. Bringing the IoT paradigm to the healthcare area, we can expand the connected health vision, enabling new Personal Health Devices (PHD) to share health information directly through the Internet. In this paper we explore the use of the MQTT (Message Queue Telemetry Transport) lightweight protocol together with the ISO/IEEE 11073 standard. We present new ways of connecting PHDs in home networks and the Internet by the use of MQTT Brokers, which will reduce the amount of data traffic.

In this paper we present Clustering Protocol for Sensor networks (CPS). Clustering techniques are used by different protocols and applications to increase scalability and reduce delays in sensor networks. Examples include routing protocols, and applications requiring efficient data aggregation. Our approach is based on the Covering Problem that aims at covering an area with minimum number of circular disks. CPS is a lightweight protocol that does not require any neighborhood information and imposes low communication overhead. We present simulation results to show the efficiency of CPS in both ideal cases and randomly distributed networks. Moreover, CPS is scalable with respect to density and network size.

The JISC-funded Focus of Access to Institutional Resources (FAIR) Programme ran from 2002-2005. The 14 projects within this programme investigated the cultural, organisational, legal and technical factors involved in providing places where institutional digital content, of which there is an increasing amount, could be stored and subsequently shared with others in the Higher and Further Education communities where appropriate. The primary technology to enable such sharing is the Open Archives Initiative Protocol for Metadata Harvesting (OAI-PMH), a lightweight protocol based on sharing metadata about the digital content available. The technical issues were at times overshadowed by the cultural, organisational and legal issues that had to be addressed. The experience of the Programme as a whole provides a valuable insight to the issues at hand in sharing content and a good starting point for other institutions wishing to investigate this capability. A Synthesis of the Programme was commissioned in late 2004...

Time synchronization may play a key role in wireless sensor networks to meet real-time and energy-saving requirements and improve data-fusion and multiplexing efficiency. In this paper, under given constraints of hardware and mathematical models, we have studied performance limitations of the time synchronization for wireless sensor networks in terms of synchronization accuracy. First, sources of synchronization errors have been identified and a mathematical model has been introduced to analyze time synchronization schemes. Second, error distributions and the accuracy limitations have been formulated according to different error-source parameters. Third, a lightweight protocol is proposed, which is capable of approaching the performance limit as well as suppressing the communication overheads. Our idea is based on the observation that there is synchronization-error correlation between nodes receiving the same sequence of time-synchronization packets. Finally the theoretical analyses have been validated by simulation results.

In this paper, we present a novel lightweight protocol for data integrity in wireless sensor networks. Our protocol is based on a leapfrog strategy in which each cluster head verifies if its previous node has preserved the integrity of the packet using the secret key it shares with two hop uptree nodes. The proposed protocol is simple. The analysis and simulation results show that the protocol needs very few header bits, as low as three bits, thus resulting in negligible bandwidth overhead; the protocol poses very low computational overhead, it needs to compute just a hash as compared to multiple complex operations required by any cryptographic implementation for verifying authenticity.

Overall fluid dynamics of the implosion, laser-plasma interaction and super hot electron generation, and super hot electron energy deposition within the core are key issues in the Fast Ignition scheme. As both time and space scales of these phenomena are much different, it is impossible to simulate all phenomena with one code, and we must simulate each phenomenon with individual codes and integrate them. We will run these codes individually, that are collaborating each other with data transfer via the computer network. Since communication among these codes is very straightforward, we design a lightweight protocol, Distributed Computing Collaboration Protocol (DCCP), to transfer data. We have planned to simulate the Fast Ignition with self consistent fields in a full range of parameters using DCCP and just started challenging Fast Ignition Integrated Interconnecting code project.

Ad hoc networks play a vital role in latest technologies, but assigning address to the nodes in ad hoc network is a major challenge due to its lack of infrastructure. A lightweight protocol is proposed in this work which helps to configure the mobile ad hoc nodes which are based on a distributed address database that is stored in filters which reduces the control load and also makes the proposal strong in partition of networks and to loss of packets. The performance of the protocol is evaluated by considering the joining nodes, partition merging events, and initialization of networks. The result of control message reduction and address collisions for the proposed protocol is shown in simulation results.

The increasing complexities of modern networks coupled with the popularity of multimedia applications have placed higher demands on network managers. This paper reviews the main requirements and challenges for effective management of multimedia networks, presents a case study of a thin-client-based multimedia system called CSL (Computer-supported Learning System) and proposes a framework for managing such networks. CSL delivers browser-based assessments and other learning materials to thousands of students at the University of Auckland. This type of demand requires more flexible schemes for the management of the network. In the framework proposed, most of the link management information will be kept in a MIB in the network and a very simple MIB will be maintained in the thin client. The MIB in the network is accessible to the network management application, and a lightweight protocol is proposed for updating of the network MIB using an agent at the thin client.

Applications of private matching (PM) are not limited to any specific domain of interest. Social media, e-health and commerce applications can afford to share certain common information without disclosing any extra details. PM ensures to reveal only common information between the communicating parties. In this paper we have presented a light weight protocol named Reflection for PM. Depending upon different requirements of involving parties, Reflection can be used in presence of third party or as a point to point communication. Using services of third party (cloud) where communication has to route through it, it still preserves the privacy aspect of values being matched. The protocol works on a random number and produces the result of matching on behalf of original values, hence it converges in only two pass communication. It also protects any additional slipway of information during or after the PM. It safeguards the user communication against eavesdropper and even from offline attacks. In its simpler version, the protocol can work without using any encryption. Value comparison mechanism in presence of encryption, makes the overall process of PM more secure against hostile users.

In the domain of distributed embedded systems, available resources regarding computing power, energy, and memory are strongly limited. With focus on the energy resources, communication hardware and communication tasks represent critical consumers for most of the common application scenarios. Accordingly, optimised approaches for the communication have to be found, including routing, topology control, and scheduling. Wake-Up-Receivers (WuRx) represent a promising approach for minimising the energy consumption in wireless communication environments. To use the conceptual benefits of such technology, an adapted communication behaviour is required. Communication paradigm, communication protocols as well as the runtime behaviour must fit together. In this paper, we introduce a WuRx-optimised routing and topology optimisation approach - WRTA. We discuss the hardware integration as well as the adaptation of the communication task scheduling on application layer. The design matching process of all these aspects allows significant improvements of the energy-efficiency in typical sensor network scenarios. For achieving these goals, WRTA represents a lightweight protocol for data-centric WSN environments. The approach combines complex route path calculations and topology optimisation mechanisms, considering a given asynchronous communi cation environment. For proof of concept, we implement several heterogeneous test benches in both soft- and hardware. Hence, the presented simulation results as well as the respective real world measurements provide interesting results regarding the scalability and the efficiency. The analysis of the data shows minimum protocol overhead and outstanding characteristics regarding scalability and robustness. We clarify that application-specific adaptations & configurations within the overall system architecture are essential to ensure an reliable communication behaviour in energy self-sufficient WuRx environments.

Radio Frequency Identification (RFID) is a key technology for the Internet of things. With the spread of RFID system, the security and privacy related to RFID plays a vital role in applications. At present, EPC C1G2 tags have been widely spread in the commodity retail, pharmaceutical sector, medicine distribution and many other fields. This kind of tags is passive, which means that they have limited power and memory space. Under these conditions, we present a new lightweight protocol for the RFID system with two tags and one reader. In the protocol, we develop a new function to realize the exchange between bits of a vector, which uses fewer resources in computing. In addition pieces of analysis show that the protocol reaches the capabilities of the grouping proofs and is resistant to a variety of attacks.

Recent standardization efforts focus on a number of lightweight IP security protocol variants for end-to-end security in the Internet of Things (IoT), most notably DTLS, HIP DEX, and minimal IKEv2. These protocol variants commonly consider public-key-based cryptographic primitives in their protocol design for peer authentication and key agreement. In this paper, we identify several performance and security issues that originate from these public-key-based operations on resource-constrained IoT devices. To illustrate their impact, we additionally quantify these protocol limitations for HIP DEX. Most importantly, we find that public-key-based operations significantly hamper a peer's availability and response time during the protocol handshake. Hence, IP security protocols in the IoT must be tailored to reduce the need for expensive cryptographic operations, to protect resource-constrained peers against DoS attacks targeting these cryptographic operations, and to account for high message processing times. To this end, we present three complementary, lightweight protocol extensions for HIP DEX: i) a comprehensive session resumption mechanism, ii) a collaborative puzzle-based DoS protection mechanism, and iii) a refined retransmission mechanism. Our focus on common protocol functionality allows to generalize our proposed extensions to the wider scope of DTLS and IKE. Finally, our evaluation confirms the considerable achieved improvements at modest trade-offs.

Certain security mechanisms assume that the end device is secured. In an IoT network, the IoT device itself could be compromised. An attacker could steal the device, gain access to it and use this for more damaging attacks. I propose an analytical framework where I specify certain mobility behavior indicators that are computed at network nodes and optionally at IoT devices. These are communicated to an analytics server using lightweight protocol enhancements specified here. IoT user specifies expected behavior using these indicators. Analytics server analyzes expected and observed values of these indicators and informs if it detects some unusual activity.

In the absence of standards for the telecommunication management network (TMN) F interface, interoperability of workstation applications can be based on the Q3 interface; Common Management Information System (CMIS)-capable interpreted scripting languages and associated lightweight string-based protocols can support the rapid construction of lightweight, portable TMN workstations.

In vehicular ad-hoc networks VANETS, security and privacy are indispensable issues for guaranteeing the soundness of such a technology. In this paper, we focus on designing an efficient and lightweight anonymous authentication scheme. We propose a novel biometrics-based mutual authentication scheme in the data-link layer to protect a vehicle's privacy during its authentication phase. Our authentication scheme includes two phases, initialisation and anonymous authentication. During the initialisation phase, biometric encryption technique is applied to generate Bioscript. During the anonymous authentication phase, a new session key is generated to achieve the traffic confidentiality. Meanwhile, a newly temporary MAC address is negotiated to conceal the real MAC address. Security and privacy analysis show that our scheme can resist various attacks in the data-link layer. Furthermore, simulation results demonstrate that our scheme is a lightweight protocol.

Multi-channel Early Warning Systems are currently used to warn the population at risk and reduce the impact of crisis. Nevertheless, satellite networks, which offer robust and reliable communication solutions during major disaster events, are not yet being fully considered for direct communication to the citizens. The paper will address solutions for the transmission of alert messages to warn/inform the population in risk during crisis through GNSS. The solution proposed is based on a protocol for alert messages that is compatible with the Common Alert Protocol (CAP), but lightweight in comparison with CAP, so that it can be applied over a variety of communication links, i.e. over different communication standards, even in very narrow band channels, such as Satellite-Based Augmentation System (SBAS). The paper will analyse the opportunities and implications of using GNSS to disseminate alert messages to the population and propose the principles for a flexible protocol that allows the translation of CAP messages (XML-based) into a very flexible and lightweight protocol for transmission in very narrow band channels.

The unprecedented development in wireless and mobile communication has brought forward incredible opportunities for mobile commerce. However the limited processing power, memory, power consumption of mobile devices and security aspects of wireless network are some of the major challenges in expanding mobile commence especially in developing country. In the present paper, an efficient protocol for mobile payment system is proposed that is based on a shared secret between the client and its bank/financial institution. While the protocol possesses all the requisite properties namely - privacy, integrity, authentication and non-repudiation, it minimizes the processing and memory requirement at the client end that makes it especially suited for low end mobile devices.

The Constrained Application Protocol (CoAP) is a lightweight protocol that enables the implementation of Restful embedded web services. Observe is one of the CoAP extensions, which allow servers to send every resource state change to interested clients. In this paper we present an interesting extension to the observe option, called conditional observation, where clients specify notification criteria along their observation request. We evaluate the feasibility of implementing this on a constrained device and evaluate the correct operation for a simple scenario. It is shown that the use of conditional observations can result in a reduced number of packets and power consumption compared to normal observe in combination with client-side filtering.

Περιέχει το πλήρες κείμενο A key requirement in linking open data refers to the rendering of such data easy to explore and consume. Such a requirement is critical for the overall quality of linked data in terms of consistency and interlinking. Although the provision of dereferenceable URIs is a step towards the right direction, current status of the semantic web indicates that such a feature alone is not enough. After all, as Berners Lee stressed, a URI is just an identifier for a resource not a recipe for its retrieval. In this paper, a decentralized infrastructure is presented capable of efficiently managing the URIs that are being consumed within the web of data. The proposed work is based on the registry, a place where triplestores may store information about their local URI entities. Such information evolves around backlinks that are defined as the references that are made from triples of remote triplestores to the locally defined URIs of a given triplestore. The registries communicate with each other through a lightweight protocol that facilitates the management and retrieval of URI entities across the LOD cloud.

Delegation is one important aspect of large-scale distributed systems where many processes and operations run on behalf of system users and clients in order to achieve highly computational and resource intensive tasks. As such, delegation is often synonymous with the concept of trust, in that the delegator would expect some degree of reliability regarding the delegatee's ability and predictability to perform the delegated task. The delegation protocol itself is expected to maintain certain basic properties, such as integrity, traceability, accountability and the ability to determine delegation chains. In this paper, we give an overview of the vulnerabilities that one such delegation protocol exhibits, namely DToken, a lightweight protocol for Grid systems, as interesting examples of design mistakes. We also propose an alternative protocol, DToken II, which �fixes such vulnerabilities.

With the development of embedded technology, embedded system in industrial control applications more and more widely, and the embedded Ethernet technology is particularly important, LwIP protocol stack, Ethernet in low-end embedded system applications may be provided, STM32 interconnected ARM processor and its official software for Embedded Ethernet application development offerred convenience condition. This paper mainly introduces the LwIP in STM32F107 hardware platform applications.

The use of mobile devices in a cooperative way is a growing trend, especially in ubiquitous environments. It has created a challenge in terms of how best to connect these devices with greater efficiency. The use of distributed service-oriented architectures (like DSOA - Device Service Oriented Architecture), which takes into account mobile devices restrictions, is shown as a natural candidate solution. In this article, we present the uP, a lightweight set of protocols designed to efficiently facilitate communication in a DSOA configuration. Empirical experiments indicate that this approach provides good results, allowing low consumption of energy in mobile devices within a DSOA environment.

This paper presents the recent technical research on the problems of privacy and security for radio frequency identification (RFID). RFID technology is already used widely and is increasingly becoming a part of daily life. However, issues regarding security and privacy with respect to RFID technology have not been resolved satisfactorily. There are huge number of challenges, which must be overcome to resolve RFID security and privacy issues. It is because of the many constraints attached to the provision of security and privacy in RFID systems. These challenges are chiefly technical and economic in nature but also include ethical and social issues. Along with meeting the security and privacy needs of RFID technology, solutions must be inexpensive, practical, reliable, scalable, flexible, inter-organizational, and long lasting. This paper reviews the approaches which had been proposed by scientists for privacy protection and integrity assurance in RFID systems, and treats the social and technical context of their work. This paper can be useful as a reference for non specialist, as well as for specialist readers.

Currently the most popular secure protocol is SSL(Secure Sockets Layer), but it has some negative aspects: First, it imposes a heavier burden on handheld wireless devices, and when a certificate uses PKI(Public Key Infrastructure) e.g. RSA algorithms, it takes a long time to establish a secure connection between client and server. This paper proposes a lightweight protocol based on the SSL protocol, which is more suitable for handheld wireless devices operating under low-capabilities, low-bandwidth and error-prone wireless links. The new lightweight SSL protocol has designed the SSL to reduce the client computational load, leaving the computational intensive operation on the server side. The client does not need to generate and encrypt the pre_master secret nor calculate the master secret. The only operation the client needs to perform is to decrypt the master secret it has received from the server. Moreover it is able to reduce the response time between client and server using SSL session reuse. It is more suitable to securely connect handheld wireless devices and servers.

Current advances in semiconductor technology have made it possible to implant a network of biosensors inside the human body for health monitoring. In the context of a body area network (BAN), the confidentiality and integrity of the sensitive health information is particularly important. In this paper, we present an ECG (electrocardiogram)-signal-based key establishment protocol to secure the communication between every sensor and the control unit before the physiological data are transferred to external networks for remote analysis or diagnosis. The uniqueness of ECG signal guarantees that our protocol can provide long, random, distinctive and temporal variant keys. Biometric Encryption technique is applied to achieve the mutual authentication and derive a non-linkable session key between every sensor and the control unit. The correctness of the proposed key establishment protocol is formally verified based on SVO logic. Security analysis shows that our protocol can guarantee data confidentiality, authenticity and integrity. Performance analysis shows that it is a lightweight protocol.

Computer communication systems must undergo significant changes to keep pace with the increasingly demanding and diverse multimedia applications that will run on the next generation of high-performance networks. To facilitate these changes, we are developing A Dynamically Assembled Protocol Transformation, Integration and evaluation Environment (ADAPTIVE). ADAPTIVE provides an integrated environment for developing and experimenting with flexible transport system architectures that support lightweight and adaptive communication protocols for diverse multimedia applications running on high-performance networks. Our approach employs a collection of reusable ‘building-block’ protocol mechanisms that may be composed together automatically based upon functional specifications. The resulting protocols execute in parallel on several target platforms including shared-memory and message-passing multiprocessors. ADAPTIVE provides a framework for (1) determining the functionality of customized lightweight protocol configurations that efficiently support multimedia applications and (2) mapping this functionality onto efficient parallel process architectures.

Radio Frequency Identification (RFID) systems are becoming more popular today because of the wide area of applications. It is being used in several industries such as the transport industry, sports, medical and government institutions. Its advantages such as the capacity to store more information than other identification technologies as well as the ease with which data can be read (since it doesn't require line of sight and human intervention), have sparked its widespread use and implementation in the various industries.The most widely used class of RFID tags is the class 1 tag because it offers identification functionality at low cost. Class 1 tags have limited computational power and memory resources. Due to these limitations, common authentication protocols such as AES cannot be implemented on the class 1 tags. As these tags provide essential implementation capabilities for development countries such as South Africa, it is vital that researchers focus on providing adequate security solutions. Taking into account the information security needs and performance limitations of the class 1 tags, we present a lightweight protocol based on the Hopper and Blum's human authentication protocol.

Critical to the successful deployment of grid systems is their ability to guarantee efficient meta-scheduling, namely optimal allocation of jobs across a pool of sites with diverse local scheduling policies. The centralized nature of current meta-scheduling solutions is not well suited for the envisioned increasing scale and dynamicity of next-generation grids, the success of which relies on the development of fully distributed, flexible and autonomic systems tailored to very large sets of highly volatile and heterogeneous resources. In this respect, we introduce a fully distributed grid meta-scheduling scheme that effectively addresses the concerns regarding the scalability and adaptability of future grid systems. Our approach employs a lightweight protocol, called A RiA, that is based on peer-to-peer communication between grid nodes, and makes use of dynamic rescheduling to consider and adapt to changes in the availability of resources. Extensive evaluation by means of an in depth simulation study highlighted the effectiveness of the proposed solution in improving the overall performance in terms of job completion time and load-balancing.

This paper presents the design and implementation of CCMP, a conference management protocol currently under standardization within the IETF, conceived at the outset as a lightweight protocol allowing conferencing clients to access and manipulate objects describing a centralized conference. The CCMP is a state-less, XML-based, client-server protocol carrying in its request and response messages conference information in the form of XML documents and fragments conforming to the centralized conferencing data model schema. It represents a powerful means to control basic and advanced conference features such as conference state and capabilities, participants and relative roles and details. We first focus on the design of the protocol and then discuss how it has been integrated in the Meetecho collaborative framework developed at the University of Napoli as an active playground for IETF standardization activities in the field of real-time applications and infrastructure.