An adaptive MAC protocol in MANETs: a democratic approach

Mobile ad-hoc networks (MANETs) have recently drawn significant research attention since they offer unique benefits and versatility with respect to bandwidth spatial reuse, intrinsic fault tolerance, and low-cost rapid deployment. This paper addresses the issue of delay sensitive realtime data transport in these type of networks. An effective QoS mechanism is thereby required for the speedy transport of the realtime data. QoS issue in MANET is an open-end problem. Various QoS measures are incorporated in the upperlayers of the network, but a few techniques addresses QoS techniques in the MAC layer. There are quite a few QoS techniques in the MAC layer for the infrastructure based wireless network. The goal and the challenge is to achieve a QoS delivery and a priority access to the real time traffic in adhoc wireless environment, while maintaining democracy in the resource allocation. We propose a MAC layer protocol called "FCP based FAMA protocol", which allocates the channel resources to the needy in a more democratic way, by examining the requirements, malicious behavior and genuineness of the request. We have simulated both the FAMA as well as FCP based FAMA and tested in various MANET conditions. Simulated results have clearly shown a performance improvement in the channel utilization and a decrease in the delay parameters in the later case. Our new protocol outperforms the other QoS aware MAC layer protocols.

An Efficient Distributed Scheme for Source Routing Protocol in Communication Networks

In this paper, we propose an efficient source routing algorithm for unicast flows, which addresses the scalability problem associated with the basic source routing technique. Simulation results indicate that the proposed algorithm indeed helps in reducing the message overhead considerably, and at the same time it gives comparable performance in terms of resource utilization across a wide range of workloads.

Secure Routing with an Integrated Localized Key Management Protocol in MANETs

A routing protocol in a mobile ad hoc network (MANET) should be secure against both the outside attackers which do not hold valid security credentials and the inside attackers which are the compromised nodes in the network. The outside attackers can be prevented with the help of an efficient key management protocol and cryptography. However, to prevent inside attackers, it should be accompanied with an intrusion detection system (IDS). In this paper, we propose a novel secure routing with an integrated localized key management (SR-LKM) protocol, which is aimed to prevent both inside and outside attackers. The localized key management mechanism is not dependent on any routing protocol. Thus, unlike many other existing schemes, the protocol does not suffer from the key management - secure routing interdependency problem. The key management mechanism is lightweight as it optimizes the use of public key cryptography with the help of a novel neighbor based handshaking and Least Common Multiple (LCM) based broadcast key distribution mechanism. The protocol is storage scalable and its efficiency is confirmed by the results obtained from simulation experiments.

Solvent effect in molecular recognition: Determining binding constants in different solvents following an extraction based protocol

Semi-rigid molecular tweezers 1, 3 and 4 bind picric acid with more than tenfold increment in tetrachloromethane as compared to chloroform.

Stability analysis of aperiodic messages scheduled in the dynamic segment of flex ray protocol

In a cyber physical system like vehicles number of signals to be communicated in a network system has an increasing trend. More and more mechanical and hydraulic parts are replaced by electronic control units and infotainment and multimedia applications has increased in vehicles. Safety critical hard real time messages and aperiodic messages communicated between electronic control units have been increased in recent times. Flexray is a high bandwidth protocol consisting of static segment for supporting hard real time messages and a dynamic segment for transmitting soft and non real time messages. In this paper, a method to obtain the stability region for the random arrival of messages in each electronic control units which is scheduled in the dynamic segment of Flexray protocol is presented. Number of mini slots available in the dynamic segment of Flexray restricts the arrival rate of tasks to the micro controllers or the number of micro controllers connected to the Flexray bus. Stability region of mathematical model of the system is compared with the Flexray protocol simulation results.

Modifications in Trypsin Digestion Protocol for Increasing the Efficiency and Coverage

Standard trypsin digestion protocol of proteins followed by MALDI-MS analysis has been realized as an important tool for the identification and characterization of proteins. In this article, we proposed the elimination of the step of `staining/de-staining of gel pieces' in in-gel digestion protocol in order to improve the efficiency of trypsin digestion. Coomassie dye is known to interfere with digestion of proteins by trypsin and the procedure of staining-de-staining could result in loss of photoaffinity probe, post translational modifications and catalytic activities of enzymes. Further, we studied parameters like hydrophobicity and isoelectric point, and attempted to quantitatively relate it to the efficiency of trypsin digestion. We suggest that properties of proteins should be considered and trypsin digestion protocol should be appropriately modified as per sequence and other information.

A Design for Performance Improvement of Clock Synchronization in WSNs using a TDMA-based MAC Protocol

Clock synchronization in a wireless sensor network (WSN) is quite essential as it provides a consistent and a coherent time frame for all the nodes across the network. Typically, clock synchronization is achieved by message passing using a contention-based scheme for media access, like carrier sense multiple access (CSMA). The nodes try to synchronize with each other, by sending synchronization request messages. If many nodes try to send messages simultaneously, contention-based schemes cannot efficiently avoid collisions. In such a situation, there are chances of collisions, and hence, message losses, which, in turn, affects the convergence of the synchronization algorithms. However, the number of collisions can be reduced with a frame based approach like time division multiple access (TDMA) for message passing. In this paper, we propose a design to utilize TDMA-based media access and control (MAC) protocol for the performance improvement of clock synchronization protocols. The basic idea is to use TDMA-based transmissions when the degree of synchronization improves among the sensor nodes during the execution of the clock synchronization algorithm. The design significantly reduces the collisions among the synchronization protocol messages. We have simulated the proposed protocol in Castalia network simulator. The simulation results show that the proposed protocol significantly reduces the time required for synchronization and also improves the accuracy of the synchronization algorithm.

Optimal scheduling of a processor executing a communication protocol stack

We consider the problem of optimally scheduling a processor executing a multilayer protocol in an intelligent Network Interface Controller (NIC). In particular, we assume a typical LAN environment with class 4 transport service, a connectionless network service, and a class 1 link level protocol. We develop a queuing model for the problem. In the most general case this becomes a cyclic queuing network in which some queues have dedicated servers, and the others have a common schedulable server. We use sample path arguments and Markov decision theory to determine optimal service schedules. The optimal throughputs are compared with those obtained with simple policies. The optimal policy yields upto 25% improvement in some cases. In some other cases, the optimal policy does only slightly better than much simpler policies.

Direct detection of Salmonella without pre-enrichment in milk, ice-cream and fruit juice by PCR against hilA gene

A novel PCR based assay was devised to specifically detect contamination of any Salmonella serovar in milk, fruit juice and ice-cream without pre-enrichment. This method utilizes primers against hilA gene which is conserved in all Salmonella serovars and absent from the close relatives of Salmonella. An optimized protocol, in terms time and money, is provided for the reduction of PCR contaminants from milk, ice-cream and juice through the use of routine laboratory chemicals. The simplicity, efficiency (time taken 3-4 h) and sensitivity (to about 5-10 CFU/ml) of this technique confers a unique advantage over other previously used time consuming detection techniques. This technique does not involve pre-enrichment of the samples or extensive sample processing, which was a pre-requisite in most of the other reported studies. Hence, this assay can be ideal for adoption, after further fine tuning, by food quality control for timely detection of Salmonella contamination as well as other food-borne pathogens (with species specific primers) in food especially milk, ice-cream and fruit juice. (C) 2011 Elsevier Ltd. All rights reserved.

A generic variant of NIST’s KAS2 key agreement protocol

We propose a generic three-pass key agreement protocol that is based on a certain kind of trapdoor one-way function family. When specialized to the RSA setting, the generic protocol yields the so-called KAS2 scheme that has recently been standardized by NIST. On the other hand, when specialized to the discrete log setting, we obtain a new protocol which we call DH2. An interesting feature of DH2 is that parties can use different groups (e.g., different elliptic curves). The generic protocol also has a hybrid implementation, where one party has an RSA key pair and the other party has a discrete log key pair. The security of KAS2 and DH2 is analyzed in an appropriate modification of the extended Canetti-Krawczyk security model.

A weighted average based external clock synchronization protocol for wireless sensor networks

Clock synchronization is an extremely important requirement of wireless sensor networks(WSNs). There are many application scenarios such as weather monitoring and forecasting etc. where external clock synchronization may be required because WSN itself may consists of components which are not connected to each other. A usual approach for external clock synchronization in WSNs is to synchronize the clock of a reference node with an external source such as UTC, and the remaining nodes synchronize with the reference node using an internal clock synchronization protocol. In order to provide highly accurate time, both the offset and the drift rate of each clock with respect to reference node are estimated from time to time, and these are used for getting correct time from local clock reading. A problem with this approach is that it is difficult to estimate the offset of a clock with respect to the reference node when drift rate of clocks varies over a period of time. In this paper, we first propose a novel internal clock synchronization protocol based on weighted averaging technique, which synchronizes all the clocks of a WSN to a reference node periodically. We call this protocol weighted average based internal clock synchronization(WICS) protocol. Based on this protocol, we then propose our weighted average based external clock synchronization(WECS) protocol. We have analyzed the proposed protocols for maximum synchronization error and shown that it is always upper bounded. Extensive simulation studies of the proposed protocols have been carried out using Castalia simulator. Simulation results validate our theoretical claim that the maximum synchronization error is always upper bounded and also show that the proposed protocols perform better in comparison to other protocols in terms of synchronization accuracy. A prototype implementation of the proposed internal clock synchronization protocol using a few TelosB motes also validates our claim.

A method of developing an agent based ubiquitous node monitoring protocol

A ubiquitous network plays a critical role to provide rendered services to ubiquitous application running nodes. To provide appropriate resources the nodes are needed to be monitored continuously. Monitoring a node in ubiquitous network is challenging because of dynamicity and heterogeneity of the ubiquitous network. The network monitor has to monitor resource parameters, like data rate, delay and throughput, as well as events such as node failure, network failure and fault in the system to curb the system failure. In this paper, we propose a method to develop a ubiquitous system monitoring protocol using agents. Earlier works on network monitoring using agents consider that the agents are designed for particular network. While in our work the heterogeneity property of the network has been considered. We have shown that the nodes' behaviour can be easily monitored by using agents (both static and mobile agent). The past behavior of the application and network, and past history of the Unode and the predecessor are taken into consideration to help SA to take appropriate decision during the time of emergency situation like unavailability of resources at the local administration, and to predict the migration of the Unode based on the previous node history. The results obtained in the simulation reflects the effectiveness of the technique.

Halogen bonds in some dihalogenated phenols: applications to crystal engineering

3,4-Dichlorophenol (1) crystallizes in the tetragonal space group I4(1)/a with a short axis of 3.7926 (9) angstrom. The structure is unique in that both type I and type II Cl.....Cl interactions are present, these contact types being distinguished by the angle ranges of the respective C-Cl....Cl angles. The present study shows that these two types of contacts are utterly different. The crystal structures of 4-bromo-3-chlorophenol (2) and 3-bromo-4-chlorophenol (3) have been determined. The crystal structure of (2) is isomorphous to that of (1) with the Br atom in the 4-position participating in a type II interaction. However, the monoclinic P2(1)/c packing of compound (3) is different; while the structure still has O-H....O hydrogen bonds, the tetramer O-H.....O synthon seen in (1) and (2) is not seen. Rather than a type I Br....Br interaction which would have been mandated if (3) were isomorphous to (1) and (2), Br forms a Br....O contact wherein its electrophilic character is clearly evident. Crystal structures of the related compounds 4-chloro-3-iodophenol (4) and 3,5-dibromophenol (5) were also determined. A computational survey of the structural landscape was undertaken for (1), (2) and (3), using a crystal structure prediction protocol in space groups P2(1)/c and I4(1)/a with the COMPASS26 force field. While both tetragonal and monoclinic structures are energetically reasonable for all compounds, the fact that (3) takes the latter structure indicates that Br prefers type II over type I contacts. In order to differentiate further between type I and type II halogen contacts, which being chemically distinct are expected to have different distance fall-off properties, a variable-temperature crystallography study was performed on compounds (1), (2) and (4). Length variations with temperature are greater for type II contacts compared with type I. The type II Br....Br interaction in (2) is stronger than the corresponding type II Cl....Cl interaction in (1), leading to elastic bending of the former upon application of mechanical stress, which contrasts with the plastic deformation of (1). The observation of elastic deformation in (2) is noteworthy; in that it finds an explanation based on the strengths of the respective halogen bonds, it could also be taken as a good starting model for future property design. Cl/Br isostructurality is studied with the Cambridge Structural Database and it is indicated that this isostructurality is based on shape and size similarity of Cl and Br, rather than arising from any chemical resemblance.

D-MG Tradeoff and Optimal Codes for a Class of AF and DF Cooperative Communication Protocols

Cooperative relay communication in a fading channel environment under the orthogonal amplify-and-forward (OAF), nonorthogonal and orthogonal selection decode-and-forward (NSDF and OSDF) protocols is considered here. The diversity-multiplexing gain tradeoff (DMT) of the three protocols is determined and DMT-optimal distributed space-time (ST) code constructions are provided. The codes constructed are sphere decodable and in some instances incur minimum possible delay. Included in our results is the perhaps surprising finding that the orthogonal and the nonorthogonal amplify-and-forward (NAF) protocols have identical DMT when the time durations of the broadcast and cooperative phases are optimally chosen to suit the respective protocol. Moreover our code construction for the OAF protocol incurs less delay. Two variants of the NSDF protocol are considered: fixed-NSDF and variable-NSDF protocol. In the variable-NSDF protocol, the fraction of time occupied by the broadcast phase is allowed to vary with multiplexing gain. The variable-NSDF protocol is shown to improve on the DMT of the best previously known static protocol when the number of relays is greater than two. Also included is a DMT optimal code construction for the NAF protocol.