RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제
      • 좁혀본 항목 보기순서

        • 원문유무
        • 원문제공처
        • 등재정보
        • 학술지명
          펼치기
        • 주제분류
        • 발행연도
          펼치기
        • 작성언어
        • 저자
          펼치기

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • KCI등재

        Gateway Discovery Algorithm Based on Multiple QoS Path Parameters Between Mobile Node and Gateway Node

        Safdar Hussain Bouk,Iwao Sasase,Syed Hassan Ahmed,Nadeem Javaid 한국통신학회 2012 Journal of communications and networks Vol.14 No.4

        Several gateway selection schemes have been proposed that select gateway nodes based on a single Quality of Service (QoS) path parameter, for instance path availability period, link capacity or end-to-end delay, etc. or on multiple non-QoS parameters,for instance the combination of gateway node speed, residual energy, and number of hops, for Mobile Ad hoc NETworks (MANETs). Each scheme just focuses on the ment of improve only a single network performance, i.e., network throughput, packet delivery ratio, end-to-end delay, or packet drop ratio. However, none of these schemes improves the overall network performance because they focus on a single QoS path parameter or on set of non-QoS parameters. To improve the overall network performance, it is necessary to select a gateway with stable path, a path with themaximum residual load capacity and the minimum latency. In this paper,we propose a gateway selection scheme that considers multiple QoS path parameters such as path availability period, available capacity and latency, to select a potential gateway node. We improve the path availability computation accuracy, we introduce a feedback system to updated path dynamics to the traffic source node and we propose an efficient method to propagate QoS parameters in our scheme. Computer simulations show that our gateway selection scheme improves throughput and packet delivery ratio with less per node energy consumption. It also improves the end-to-end delay compared to single QoS path parameter gateway selection schemes. In addition, we simulate the proposed scheme by considering weighting factors to gateway selection parameters and results show that the weighting factors improve the throughput and endto-end delay compared to the conventional schemes.

      • KCI등재

        IPv6 Autoconfiguration for Hierarchical MANETs with Efficient Leader Election Algorithm

        Safdar Hussain Bouk,Iwao Sasase 한국통신학회 2009 Journal of communications and networks Vol.11 No.3

        To connect a mobile ad hoc network (MANET) with an IP network and to carryout communication, ad hoc network node needs to be configured with unique IP adress. Dynamic host configuration protocol (DHCP) server autoconfigure nodes in wired networks. However, this cannot be applied to ad hoc network without introducing some changes in auto configuration mechanism, due to intrinsic properties (i.e., multi-hop, dynamic, and distributed nature) of the network. In this paper, we propose a scalable autoconfiguration scheme for MANETs with hierarchical topology consisting of leader and member nodes, by considering the global Internet connectivity with minimum overhead. In our proposed scheme, a joining node selects one of the pre-configured nodes for its duplicate address detection (DAD) operation. We reduce overhead and make our scheme scalable by eliminating the broadcast of DAD messages in the network. We also propose the group leader election algorithm, which takes into account the resources, density, and position information of a node to select a new leader. Our simulation results show that our proposed scheme is effective to reduce the overhead and is scalable. Also, it is shown that the proposed scheme provides an efficient method to heal the network after partitioning and merging by enhancing the role of bordering nodes in the group.

      • SCIESCOPUSKCI등재

        Gateway Discovery Algorithm Based on Multiple QoS Path Parameters Between Mobile Node and Gateway Node

        Bouk, Safdar Hussain,Sasase, Iwao,Ahmed, Syed Hassan,Javaid, Nadeem The Korea Institute of Information and Commucation 2012 Journal of communications and networks Vol.14 No.4

        Several gateway selection schemes have been proposed that select gateway nodes based on a single Quality of Service (QoS) path parameter, for instance path availability period, link capacity or end-to-end delay, etc. or on multiple non-QoS parameters, for instance the combination of gateway node speed, residual energy, and number of hops, for Mobile Ad hoc NETworks (MANETs). Each scheme just focuses on the ment of improve only a single network performance, i.e., network throughput, packet delivery ratio, end-to-end delay, or packet drop ratio. However, none of these schemes improves the overall network performance because they focus on a single QoS path parameter or on set of non-QoS parameters. To improve the overall network performance, it is necessary to select a gateway with stable path, a path with themaximum residual load capacity and the minimum latency. In this paper, we propose a gateway selection scheme that considers multiple QoS path parameters such as path availability period, available capacity and latency, to select a potential gateway node. We improve the path availability computation accuracy, we introduce a feedback system to updated path dynamics to the traffic source node and we propose an efficient method to propagate QoS parameters in our scheme. Computer simulations show that our gateway selection scheme improves throughput and packet delivery ratio with less per node energy consumption. It also improves the end-to-end delay compared to single QoS path parameter gateway selection schemes. In addition, we simulate the proposed scheme by considering weighting factors to gateway selection parameters and results show that the weighting factors improve the throughput and end-to-end delay compared to the conventional schemes.

      • SCIESCOPUSKCI등재

        IPv6 Autoconfiguration for Hierarchical MANETs with Efficient Leader Election Algorithm

        Bouk, Safdar Hussain,Sasase, Iwao The Korea Institute of Information and Commucation 2009 Journal of communications and networks Vol.11 No.3

        To connect a mobile ad hoc network (MANET) with an IP network and to carryout communication, ad hoc network node needs to be configured with unique IP adress. Dynamic host configuration protocol (DHCP) server autoconfigure nodes in wired networks. However, this cannot be applied to ad hoc network without introducing some changes in auto configuration mechanism, due to intrinsic properties (i.e., multi-hop, dynamic, and distributed nature) of the network. In this paper, we propose a scalable autoconfiguration scheme for MANETs with hierarchical topology consisting of leader and member nodes, by considering the global Internet connectivity with minimum overhead. In our proposed scheme, a joining node selects one of the pre-configured nodes for its duplicate address detection (DAD) operation. We reduce overhead and make our scheme scalable by eliminating the broadcast of DAD messages in the network. We also propose the group leader election algorithm, which takes into account the resources, density, and position information of a node to select a new leader. Our simulation results show that our proposed scheme is effective to reduce the overhead and is scalable. Also, it is shown that the proposed scheme provides an efficient method to heal the network after partitioning and merging by enhancing the role of bordering nodes in the group.

      • SCISCIESCOPUS

        Named-Data-Networking-Based ITS for Smart Cities

        Bouk, Safdar Hussain,Ahmed, Syed Hassan,Kim, Dongkyun,Song, Houbing Institute of Electrical and Electronics Engineers 2017 IEEE communications magazine Vol.55 No.1

        <P>A smart city enhances the quality of its citizens' lives by providing ease of access to ubiquitous services through integration using communication systems at the foundation. Additionally, ITS plays a major role in making a metropolitan area into a smart city. The current IP-based solutions for ITS have slanted the performance due to high demand for data on the move, especially when the consumers become the producers. Meanwhile, NDN has evolved as a promising future Internet architecture and is being investigated extensively. In this article, we discuss the core functionality of NDN followed by our new architecture proposed for ITS in smart cities. Also, we highlight the current and future research challenges for NDN-enabled ITS in the context of smart cities.</P>

      • SCISCIESCOPUS

        Realization of VANET-Based Cloud Services through Named Data Networking

        Hussain, Rasheed,Bouk, Safdar H.,Javaid, Nadeem,Khan, Adil M.,Lee, Jooyoung Institute of Electrical and Electronics Engineers 2018 IEEE communications magazine Vol.56 No.8

        <P>Connected car technology (also referred to as VANET) has gradually paved its way to legislation in several countries and soon will be followed by mass-scale deployment. However, the race between the advancements in technologies and utilization of the available resources have left a question mark on the future of pure VANET. Therefore, the research community together with academia and industry have foreseen the evolution of VANET into VANET-based clouds. The data- or content-centric communication paradigm is the point of convergence in these technologies because the content is shared among different nodes in different forms such as infotainment or safety. However, the current IP-based networking is not an ideal choice for content-centric applications because of its larger overhead for establishing, maintaining, and securing the path, addressing complexity, non-scalability for content, routing and mobility management overhead, and so on. Therefore, the limitations and shortcomings of current IP-based networking and the need for efficient content delivery advocate for a paradigm shift. To this end, a new content-centric networking paradigm, namely NDN, has been employed to address the aforementioned issues related to content-centric networking while using IP-based networking. In this article, we foresee the integration of VANET-based clouds with NDN called NDN-VC for reliable, efficient, robust, and safe intelligent transportation systems. We particularly aim at the architecture and concise naming mechanism for NDN-VC. Furthermore, we also outline the unique future challenges faced by the NDN-VC.</P>

      • SCIESCOPUS
      • SCISCIESCOPUS

        CODIE: Controlled Data and Interest Evaluation in Vehicular Named Data Networks

        Ahmed, Syed Hassan,Bouk, Safdar Hussain,Yaqub, Muhammad Azfar,Kim, Dongkyun,Song, Houbing,Lloret, Jaime IEEE 2016 IEEE Transactions on Vehicular Technology VT Vol.65 No.6

        <P>Recently, named data networking (NDN) has been proposed as a promising architecture for future Internet technologies. NDN is an extension to the content-centric network (CCN) and is expected to support various applications in vehicular communications [ vehicular NDN (VNDN)]. VNDN basically relies on naming the content rather than using end-to-end device names. In VNDN, a vehicle broadcasts an 'Interest' packet for the required 'content,' regardless of end-to-end connectivity with servers or other vehicles and known as a 'consumer.' In response, a vehicle with the content replies to the Interest packet with a 'Data' packet and named as a 'provider.' However, the simple VNDN architecture faces several challenges such as consumer/provider mobility and Interest/Data packet(s) forwarding. In VNDN, for the most part, the Data packet is sent along the reverse path of the related Interest packet. However, there is no extensive simulated reference available in the literature to support this argument. In this paper, therefore, we first analyze the propagation behavior of Interest and Data packets in the vehicular ad hoc network (VANET) environment through extensive simulations. Second, we propose the 'CODIE' scheme to control the Data flooding/broadcast storm in the naive VNDN. The main idea is to allow the consumer vehicle to start hop counter in Interest packet. Upon receiving this Interest by any potential provider, a data dissemination limit (DDL) value stores the number of hops and a data packet needs to travel back. Simulation results show that CODIE forwards fewer copies of data packets processed (CDPP) while achieving similar interest satisfaction rate (ISR), as compared with the naive VNDN. In addition, we also found that CODIE also minimizes the overall interest satisfaction delay (ISD), respectively.</P>

      • DIFS: Distributed Interest Forwarder Selection in Vehicular Named Data Networks

        Ahmed, Syed Hassan,Bouk, Safdar Hussain,Yaqub, Muhammad Azfar,Kim, Dongkyun,Song, Houbing IEEE 2018 IEEE transactions on intelligent transportation sy Vol.19 No.9

        <P>In this paper, we propose a distributed interest forwarder selection (DIFS) scheme that mitigates the interest broadcast storm in vehicular named data networks. In DIFS, a vehicle sends an interest packet piggybacking its location, distance to the neighbors, and speed. In this case, the immediate neighbors do not have the requested content and rank themselves to be an eligible interest forwarder by using multiple attributes. Additionally, every intermediate vehicle uses a digital map to be selected as forwarders in both (forward and backward) directions of the consumer. Simulations show that DIFS satisfies more interest packets with less delay as compared with the recent forwarding solutions.</P>

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼