Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
home > search

Now showing items 1 - 15 of 15

  • Static and Dynamic Connection Establishment in WDM Optical Networks: A Review

    Datta, Raja   Sengupta, Indranil  

    In this paper, we give a brief review of the work done by various researchers over the years in the area of wavelength division multiplexed (WDM) optical network and more specifically in the area of connection establishment optical WDM is the most promising solution for setting up of the next generation networks. Static and dynamic lightpath establishments are the two types of lightpath establishments in WDM networks. In static environment the lightpath establishment is permanent, whereas in dynamic environment the lightpaths are established in real time and taken down as per requirement. We review the important algorithms under static and dynamic connection establishment. We also discuss the use of evolutionary algorithms in optical networks and review distributed optical network control algorithms, as these topics are generating lot of interest now-a-days. To make this review concise, we have confined it to the cases where connections are established in WDM networks without wavelength converters
    Download Collect
  • STAR-CUBE: A Special Purpose Interconnection Network for Signal Processing

    Datta, Raja   Biswas, Prabir Kumar  

    Both hypercube and star graph networks possess desirable properties like regularity, vertex and edge symmetric, maximally fault-tolerant etc, though, some of the attractive features of one are not found in the other. In this paper, we propose and study a composite architecture, which is a combination of these two architectures and call it Star-Cube. The most important characteristic of the proposed star-cube network is that, it can be incremented in smaller steps. This is an advantage for FFT implementation as an architecture with reasonable number of nodes can be made out of this star-cube graph that will give more processor utilization than either star-graph or Hypercube architecture individually. It provides some of the desirable properties of both the networks such as reduced diameter and degree. The degree and diameter of the proposed network falls in-between its individual constituents that make it suitable for fast Fourier transform (FFT) type of processing. The proposed Star-Cube network has simple routing algorithms amenable to networks with faults. Other parameters such as average distance, number of links, fault-tolerance, etc, are computed. To show its performance, a fast Fourier transform algorithm is considered for implementation in this hybrid network where a hierarchical ranking scheme is adopted for assigning node addresses. We estimate the speedup and efficiency for the Star-Cube graph. It is observed that our proposed star-cube interconnection network gives reasonable speedup as compared to hypercube and star graph as FFT processor
    Download Collect
  • A Novel Approach for Efficient Usage of Intrusion Detection System in Mobile Ad Hoc Networks

    Marchang, Ningrinla   Datta, Raja   Das, Sajal K.  

    Mobile ad hoc networks (MANETs) are self-configuring infrastructureless dynamic wireless networks in which the nodes are resource constrained. Intrusion detection systems (IDSs) are used in MANETs to monitor activities to detect any intrusion in the otherwise vulnerable network. In this paper, we present efficient schemes for analyzing and optimizing the time duration for which the IDSs need to remain active in a MANET. A probabilistic model is proposed, which makes use of cooperation between IDSs among neighborhood nodes to reduce their individual active time. Typically, an IDS has to run all the time on every node to oversee network behavior. This can turn out to be a costly overhead for a battery-powered mobile device in terms of power and computational resources. Hence, in this work, our aim is to reduce the duration of active time of the IDSs without compromising their effectiveness. To validate our proposed approach, we model the interactions between IDSs as a multiplayer cooperative game in which the players have partially cooperative and partially conflicting goals. We theoretically analyze this game and support it with simulation results.
    Download Collect
  • A Stochastic Process based Framework of Redeployment Model for Wireless Sensor Network

    Bhatt, Ravindara   Datta, Raja  

    In this paper we propose a redeployment scheme of Wireless Sensor Network (WSN) nodes based on a stochastic process. WSN suffers from formation of hole in the network due to its asymmetric deployment, unbalanced energy consumption and intentional destruction of nodes in the network. The dynamic increase in Quality-of-Service (QoS) parameters such as coverage and connectivity also may lead to formation of holes which in turn degrades the performance of the network. Therefore, in order to maintain a desired QoS, a sensor redeployment scheme is important in WSN. During its lifecycle, a sensor node experiences active, sleep, diagnose, vulnerable, repair, and fail states. We analyze the Markov process and obtain the steady state probabilities for all the states. The availability of the nodes is presented with the help of SHARPE tool. Our work utilizes Discrete-Time Markov Chain and a Semi-Markov Process to illustrate the probabilities of WSN node in various states. The required redeployment nodes are then computed based on a stochastic analysis of the system and subject to the QoS requirements of the network.
    Download Collect
  • Impact of BER in Fragmentation-Aware Routing and Spectrum Assignment in Elastic Optical Networks

    Adhikari, Devlina   Datta, Debasish   Datta, Raja  

    Download Collect
  • Collaborative techniques for intrusion detection in mobile ad-hoc networks

    Marchang, Ningrinla   Datta, Raja  

    In this paper, we present two intrusion detection techniques for mobile ad-hoc networks, which use collaborative efforts of nodes in a neighborhood to detect a malicious node in that neighborhood. The first technique is designed for detection of malicious nodes in a neighborhood of nodes in which each pair of nodes in the neighborhood are within radio range of each other. Such a neighborhood of nodes is known as a clique [12]. The second technique is designed for detection of malicious nodes in a neighborhood of nodes, in which each pair of nodes may not be in radio range of each other but where there is a node among them which has all the other nodes in its one-hop vicinity. This neighborhood is identical to a cluster as mentioned in [12]. Both techniques use message passing between the nodes. A node called the monitor node initiates the detection process. Based on the messages that it receives during the detection process, each node determines the nodes it suspects to be malicious and send votes to the monitor node. The monitor node upon inspecting the votes determines the malicious nodes from among the suspected nodes. Our intrusion detection system is independent of any routing protocol. We give the proof of correctness of the first algorithm, which shows that it correctly detects the malicious nodes always when there is no message loss. We also show with the help of simulations that both the algorithms give good performance even when there are message losses arising due to unreliable channel. (C) 2007 Elsevier B.V. All rights reserved.
    Download Collect
  • CoopMACA: a cooperative MAC protocol using packet aggregation

    Jibukumar, M. G.   Datta, Raja   Biswas, Prabir K.  

    In this paper we propose a cooperative MAC protocol for Wireless Local Area Networks (WLAN) that involves the concept of cooperation among nodes to avoid the negative effect caused by multi rate modulation employed in IEEE 802.11 standards. In our proposed protocol a low data rate direct transmission link is replaced by two faster transmission links using a relay node. During transmission, each node selects either direct or indirect transmission (through a helper node) in order to minimize the total transmission time and utilizes the packet aggregation concept to improve the system throughput. The new protocol does not violate the inter frame space specified in IEEE 802.11 and shows compatibility with the standard. We give the mathematical analysis that shows that our proposed protocol increases the system throughput considerably in comparison to the existing ones. The analytical results are supported with the help of simulation. We have shown how this protocol can be implemented in combination with others to improve the system throughput in specific network scenarios.
    Download Collect
  • New packet aggregation schemes for multimedia applications in WLAN

    Biswas, P K   Datta, Raja   Jibukumar, M G  

    In IEEE 802.11 standard MAC layer and Physical layer overheads are necessary for the proper synchronization of transmitter and receiver besides sharing the wireless medium efficiently. To increase the network efficiency, the ratio of header size to payload size in a packet has to be reduced. The new IEEE WLAN amendment, IEEE 802.11n, allows aggregation of packets to increase the payload size. Here a node aggregates the packets of different applications to compose a larger packet before it is send to the access point (AP). However, this method fails in the case of delay sensitive multimedia applications. In this paper, we propose three methods that use packet aggregation to improve the system throughput of real time multimedia applications in a WLAN. These schemes use capture effect, power control scheme and directionality of antenna to allow concurrent packet transmissions in a WLAN. Our simulation studies show that these schemes increase the system throughput considerably.
    Download Collect
  • An authenticated dynamic IP configuration scheme for mobile ad hoc networks

    Datta, Raja   Ghosh, Uttam  

    Secure dynamic IP addressing is a prime requirement for unicast communication between authorized hosts in mobile ad hoc networks. Recently; several approaches have been proposed for dynamic addressing scheme. However; most of the approach rely on broadcasting for address solicitation and/or duplicate address detection. As a result; several types of security threats in dynamic IP configuration can be observed. In this paper; we present an authentication based dynamic IP configuration scheme that can securely allocate IP addresses to the authenticated hosts for a mobile ad hoc network without broadcasting over the entire network. Each host in the MANET can generate new unique IP address from its own IP address for a new authenticated host. This scheme provides authentication for address configuration with the help of a trusted third party and as such capable of handling the security threats associated with dynamic IP configuration. Performance analysis shows that our proposed addressing scheme has less addressing latency and control overhead compared to the similar existing schemes. Moreover; the proposed scheme is able to solve the problem of network partitions and mergers along with arrival and departure of a host efficiently.
    Download Collect
  • A secure dynamic IP configuration scheme for mobile ad hoc networks

    Ghosh, Uttam   Datta, Raja  

    Secure dynamic IP addressing is a prime requirement for unicast communication between authorized hosts in mobile ad hoc networks (MANETs). Recently, several approaches have been proposed for dynamic addressing scheme. However, most of the approaches rely on broadcasting for address solicitation and/or duplicate address detection. As a result, several types of security threats in dynamic IP configuration can be observed. In this paper, we present an ID based dynamic IP configuration scheme that can securely allocate IP addresses to the authorized hosts for a mobile ad hoc network without broadcasting over the entire network. Each host in the MANET can generate an unique IP address from its own IP address for a new host. The proposed scheme provides authentication for address configuration without the help of a trusted third party while taking care of the security-threats associated with dynamic IP configuration. Performance analysis shows that even with added security mechanisms our proposed addressing scheme has fairly good addressing latency and control overhead compared to the similar existing schemes. Moreover, the proposed scheme is able to solve the problem of network partitions and mergers along with the arrival and departure of a host efficiently and securely. (C) 2011 Elsevier B.V. All rights reserved.
    Download Collect
  • DAMS: D2D-assisted multimedia streaming service with minimized BS transmit power in cellular networks

    Barik, Pradip Kumar   Singhal, Chetna   Datta, Raja  

    Download Collect
  • Kalman filter based Variable Bit Rate video frame size prediction

    Jibukumar, M. G.   Datta, Raja   Biswas, P. K.  

    Dynamic bandwidth allocation based on network traffic prediction is an important area of multimedia networking. In this paper, we present a frame size traffic prediction for MPEG-4 (Moving Picture Expert Group) VBR (Variable Bit Rate) videos. Accurate prediction of VBR video, traffic can be used to improve the network utilization while supporting the requirement of VBR video. In this paper we propose a Kalman filter based estimation of video frame size and compare its performance with other time domain prediction methods (normalized NLMS). Our proposed method uses past values for estimation and therefore can be used for online traffic measurement Simulation results show that our proposed algorithm is effective in predicting the future traffic.
    Download Collect
  • Security for Mobile Ad Hoc Networks

    Datta, Raja   Marchang, Ningrinla  

    Download Collect
  • A game theoretic framework for stochastic multipath routing in self-organized MANETs

    Sarkar, Sajal   Datta, Raja  

    In this paper we propose a game theoretic framework for stochastic multipath routing in mobile ad hoc networks (MANETs). In a MANET, intelligent and adaptive attackers may try to hijack, jam or intercept data packets traveling from source to destination. In our proposed game, at each stage the sotirce node keeps track of the available multiple paths, the residual bandwidth of the paths and the strategy of the attackers from the information gathered during the previous stage. Based on these observations, the source node selects a path for data communication and switching strategy among the multiple established paths between the source node and the destination node. Accordingly, it selects an optimal routing strategy to send data packets to the destination at each stage of the game. Using minimax-Q learning, the selected routing strategy maximizes the expected sum of per stage discounted payoff, which is the utilization of residual bandwidth between a source-destination pair along with the probability that the path is safe. Performance analysis and numerical results show that our proposed scheme achieves significant performance gains in terms of residual bandwidth utilization, average end-to end delay, packet delivery ratio, routing overhead and security. (C) 2016 Elsevier B.V. All rights reserved.
    Download Collect
  • An Adaptive Protocol for Stable and Energy-Aware Routing in MANETs

    Sarkar, Sajal   Datta, Raja  

    In mobile ad-hoc networks (MANETs), routing protocols are impaired by its nodes' mobility, misbehaviour, and insufficient battery power. In order to overcome the above-mentioned impairments of routing protocols, in this paper, we propose a multiple routing metrics based stable and energy-aware routing protocol. In route discovery phase, our proposed protocol establishes a stable, secure, and energy-aware route from a source node to a destination node based on the multiple routing metrics derived considering mobility, energy level, and data packet forwarding statistic of mobile nodes. In route maintenance phase, the protocol monitors neighbours of the intermediate nodes so that it may minimally redefine the established route whenever a link gets disrupted or a node reaches a threshold value with regard to its routing metrics. A trust module is also included in the proposed protocol which gives inputs regarding nodes' trustworthiness so as to keep a path as reliable as possible. Simulation results show that our protocol increases packet delivery ratio and reduces average end-to-end delay and average energy consumption in different MANET scenarios.
    Download Collect
1

Contact

If you have any feedback, Please follow the official account to submit feedback.

Turn on your phone and scan

Submit Feedback