COMPUTER SCIENCE & ENGINEERING

The advent of multiagent systems has brought together many disciplines and given us a new way to look at intelligent, distributed systems. However, traditional ways of thinking about and designing software do not fit the multiagent paradigm. This paper describes the Multiagent Systems Engineering (MaSE) methodology and agentTool, a tool to support MaSE. MaSE guides a designer from an initial system specification to implementation by guiding the designer through a set of inter-related graphically based system models. The underlying formal syntax and semantics of clearly and unambiguously ties them together as envisioned by MaSE.

Mobile ad hoc networks communicate without any fixed infrastructure or ant centralized domain. All the nodes are free to move randomly within the network and share information dynamically. To achieve an efficient routing various protocols have been developed so far which vary in their nature and have their own salient properties. In this paper, we have discussed one of the latest protocols i.e. Dynamic Manet on demand (DYMO) routing Protocol, implemented and analysed its performance with other similar protocols against different parameters. Finally a comparison has been presented between all of them.

Abstract Due to significant advances in miniaturization, low power circuit design but reasonably efficient to carry the sensitive information through wireless communication, wireless sensor network (WSN) have attracted attention a lot in recent years. WSN's are being used in many applications like health monitoring, military purposes, and home automation.

A Wireless Sensor Network (WSN) is a collection of thousands of tiny sensor nodes having the capability of wireless communication, limited computation and sensing. These networks are vulnerable to internal and external attacks due to the lack of tamper-resistant packaging and the insecure nature of wireless communication channels. Since most of the existing routing protocols are application specific and hence do not satisfy the security constraints of wireless sensor networks. Whenever any device comes within the frequency range can get the access to the transmitting data and may affect the transmission. In this paper, we simulated the concept of frequency hopping and proved it a better approach to provide security in WSN..

A Wireless Sensor Network (WSN) is a collection of thousands of tiny sensor nodes having the capability of wireless communication, limited computation and sensing. In this paper, all the components of a sensor node are discussed in brief. Also, a comparison of two routing protocols Flooding and Directed Diffusion on the basis of throughput, energy consumption and network lifetime is presented.

Authentication in low power devices is still considered to be an expensive process. CertificateLess Signature is one of the approaches to facilitate authentication in these devices. Wireless Sensor Networks (WSNs) are such low power inexpensive networks, which needs authentication of message. In this paper, a CertificateLess Signature proposed by Gong et al. is analyzed and an approach is being proposed to reduce the computation cost by more than 50 percent. The main benefits of our approach are (i) some computations can be performed by Key Generation Center (KGC) instead of sensor node (ii) signature size is merely increased a few bytes but saves a lot computation in multi-hop networks (iii) balance of computations on all sensor nodes and hence, increases the overall network lifetime.

WSN is the collection of thousands of tiny sensor nodes which have the capability of sensing, computing and transmitting the information in the network. Due to the low circuit design, it has some resource constraints but still efficient to carry the information through wireless communication. The exchange of information in a secure manner is critical in WSN. There are many techniques developed in recent years for the security purposes, one of the core areas is the key management. Key management is a challenging issue in sensor networks. In this paper classification of key management techniques for wireless sensor networks based on the encryption techniques has been presented. Also the open issues in this area are focused.

Wireless Sensor Networks consist of small, inexpensive, low-powered sensor nodes that communicate with each other. To achieve a low communication cost in a resource constrained network, a novel concept of signcryption has been applied for secure communication. Signcryption enables a user to perform a digital signature for providing authenticity and public key encryption for providing message confidentiality simultaneously in a single logical step with a lower cost than that of the sign-then-encrypt approach. Ring signcryption maintains the signer's privacy, which is lacking in normal signcryption schemes. Signcryption can provide confidentiality and authenticity without revealing the user's identity of the ring. This paper presents the security notions and an evaluation of an ID-based ring signcryption scheme for wireless sensor networks. The scheme has been proven to be better than the existing schemes. The proposed scheme was found to be secure against adaptive chosen ciphertext ring attacks (IND-IDRSC-CCA2) and secure against an existential forgery for adaptive chosen message attacks (EF-IDRSC-ACMA). The proposed scheme was found to be more efficient than scheme for Wireless Sensor Networks reported by Qi. et al. based on the running time and energy consumption.

A Wireless Sensor Network (WSN) is a wireless network which consists of large number of sensor nodes having the capability of wireless communication, limited computation and sensing. In this paper, a comparison of WSN with other wireless networks is presented. Also a comparison of various routing protocols is presented on the basis of network architecture and functionalities.

Recent technical advances have made it possible to develop such devices, which are small in size, cheap and capable of wireless communication using radio interfaces and provide pervasive services to the user. Sensor networks are the extreme examples of such ubiquous and pervasive computer paradigm.

The concept of forward secrecy is extended to wireless sensor networks where it is frequent that nodes run out of energy and new nodes join the network. However it should not be able to retrieve the previous session key or some crucial information. In 2011 Hagras et al. proposed a key management scheme for heterogeneous wireless sensor networks, which satisfies confidentiality, authentication, integrity and unforgeability but lacks forward secrecy. In this paper, the shortcomings of the victim scheme has been extricated and repaired with the help of Elliptic Curve Discrete logarithm problem (ECDLP). An elliptic curve based signcryption key management scheme has been proposed which includes forward secrecy.

WSN is the collection of thousands of tiny sensor nodes, which have the capability of sensing, computing and transmitting the information in the network. Due to the low circuit design, it has some resource constraints but efficient to carry the information through wireless communication. But the exchange of information in a secure manner is critical in WSN. There are many techniques developed in recent years for the security purposes, one of the area is the key management. Key management is the challenging issue in sensor networks. In this paper we present the key management techniques for wireless sensor networks and classification has been presented based on the encryption techniques.

Wireless Sensor Network (WSN) has proved its presence in various real time applications and hence the security of such embedded devices is a vital issue. Certificateless cryptography is one of the recent paradigms to provide security. Certificateless public key cryptography (CL-PKC) deals effectively with the twin issues of certificate management in traditional public key cryptography and key escrow problem in identity-based cryptography. CL-PKC has attracted special attention in the field of information security as it has opened new avenues for improvement in the present security architecture. Recently, Tsai et al. proposed an improved certificateless signature scheme without pairing and claimed that their new construction is secure against different kinds of attacks. In this paper, we present a security analysis of their scheme and our results show that scheme does not have resistance against malicious-KGC attack. In addition, we have found some security flaws in the certificateless signature scheme of Fan et al. and proved the scheme vulnerable to Strong Type I attack.

Human genes are not continuous but rather consist of short coding regions (exons) interspersed with highly variable non-coding regions (introns). We apply HMMs to the problem of modeling exons, introns and detecting splice sites in the human genome. Our most interesting result so far is the detection of particular oscillatory patterns, with a minimal period ofroughly 10 nucleotides, that seem to be characteristic of exon regions and may have significant biological implications.