• Journal of information and communication convergence engineering
• /
• 제5권4호
• /
• pp.300-304
• /
• 2007

Wireless sensor networks represent a new and exciting communication paradigm which could have multiple applications in future wireless communication. Therefore, performance analysis of such a wireless sensor network paradigm is needed in complex wireless channel. Wireless networks could be an important means of providing ubiquitous communication in the future. In this paper, the BER performance of uniform distributed wireless sensor networks is evaluated in non-Gaussian noise channel. Using an analytical approach, the impact of Av. BER performance relating the coherent BPSK system at the end of a multi-hop route versus the spatial density of sensor nodes and impulsive noise parameters A and $\Gamma$ is evaluated.

• Journal of information and communication convergence engineering
• /
• 제10권2호
• /
• pp.129-134
• /
• 2012

As application-specific requirements for wireless sensor networks emerge, both real-time and reliable communications become major research challenges in wireless sensor networks due to the many constraints on nodes and wireless links. To support these services, several protocols have been proposed. However, since most of them were designed as well as developed for general purpose applications, it is not recommended that they be directly adapted to applications with special requirements. In this paper, we propose a way to extend the current reliable transport protocol to cover a special real-time service, the (m,k)-firm deadline stream, in wireless sensor networks. While the proposed scheme is basically built on the PSFQ protocol for reliability, some features have been newly developed to support the (m,k)-firm stream efficiently. Finally, simulation results are given to demonstrate the feasibility of the proposed scheme in high traffic and with failed links.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제3권1호
• /
• pp.5-25
• /
• 2009

In recent years the popularity of multi-hop wireless networks has been growing. Its flexible topology and abundant routing path enables many types of applications. However, the lack of a centralized controller often makes it difficult to design a reliable service in multi-hop wireless networks. While packet routing has been the center of attention for decades, recent research focuses on data discovery such as file sharing in multi-hop wireless networks. Although there are many peer-to-peer lookup (P2P-lookup) schemes for wired networks, they have inherent limitations for multi-hop wireless networks. First, a wired P2P-lookup builds a search structure on the overlay network and disregards the underlying topology. Second, the performance guarantee often relies on specific topology models such as random graphs, which do not apply to multi-hop wireless networks. Past studies on wireless P2P-lookup either combined existing solutions with known routing algorithms or proposed tree-based routing, which is prone to traffic congestion. In this paper, we present two wireless P2P-lookup schemes that strictly build a topology-dependent structure. We first propose the Ring Interval Graph Search (RIGS) that constructs a DHT only through direct connections between the nodes. We then propose the ValleyWalk, a loosely-structured scheme that requires simple local hints for query routing. Packet-level simulations showed that RIGS can find the target with near-shortest search length and ValleyWalk can find the target with near-shortest search length when there is at least 5% object replication. We also provide an analytic bound on the search length of ValleyWalk.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2009년도 춘계학술대회
• /
• pp.805-808
• /
• 2009

Security has become a major concern for many real world applications for wireless sensor networks (WSN). In this domain, many security solutions have been proposed. Usually, all these approaches are based on wellknown cryptographic algorithms. At the same time, performance studies have shown that the applicability of sensor networks strongly depends on effective routing decisions or energy aware wireless communication. In this paper, we analyses vulnerability and security mechanisms in wireless sensor networks.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2008년도 추계학술발표대회
• /
• pp.1314-1315
• /
• 2008

Recent research work has unearthed that multi-radio multi-channel wireless mesh networks offer considerable capacity gains over single-radio wireless mesh networks. In this paper, we present a new routing metric for multi-radio multi-channel wireless mesh networks. The goal of the metric is to choose multiple link/node disjoint paths between a source and destination node that, when used concomitantly, impart high end-to-end throughput. The proposed metric selects high fidelity paths that will produce elevated throughput with maximum fault tolerance.

• 한국통신학회논문지
• /
• 제29권2B호
• /
• pp.151-157
• /
• 2004

본 논문은 밀리미터파 대역용 무선통신송수신기를 이용하여 도시환경에 적합한 초고속무선통신 셀백본망을 구축하는 것에 관한 것이다. 밀리미터파 대역중 산소분자의 신호흡수 특성이 큰 60㎓ 대역용 무선통신송수신기를 제작하였으며, 이를 이용한 통신시스템간의 간섭신호가 제거되고 망구성의 형태에 따른 다양한 무선링크의 유효거리를 확보할 수 있음을 확인하였다. 또한 무선백본노드를 중심으로 유효반경 약 500m에서 3km이내의 셀간격으로 각각의 서비스망을 구축하여 도시전체를 셀망의 무선백본망을 구성하고, 155.52MbpsATM(OC-3)급의 도시형 무선 통신 셀백본망이 가능토록 하였다.

• 한국멀티미디어학회논문지
• /
• 제7권2호
• /
• pp.187-193
• /
• 2004

오늘날 무선 네트워크는 통신에서 매우 중요한 역할을 하고 있다. 예를 들어, 오늘날의 무선 네트워크는 이메일, FTP와 같은 기본 서비스로부터 웹 서비스 같은 멀티미디어 응용 서비스를 제공하고 있다. 무선 네트워크에서의 이와 같은 다양한 응용들의 서비스 질에 대한 요구는 유선 네트워크에서와 마찬가지로 무선 네트워크에서도 계속 이어질 것이 확실하다. 최근에 인터넷에서 서비스의 차별화를 지원하려는 많은 연구가 이루어지고 있다. 그러나 무선 환경에서는 제한된 대역폭과 채널 상태의 변화로 인하여 이러한 차별화서비스 지원이 더욱 어렵다. 본 논문에서는 실시간 트래픽 서비스와 비실시간 트래픽 서비스가 공존하는 인터넷 환경에서 실시간 트래픽 서비스의 질을 지원하는 수정된 무선 토큰링 프로토콜을 제안하고 있다. 제안된 알고리즘에서는 실시간 트래픽 서비스 노드가 비실시간 트래픽 서비스 노드보다 토큰 수신에 있어서 우선권을 가진다. 따라서 제안된 알고리즘은 실시간 트래픽 서비스 노드의 빠른 전송을 지원하며, 또한 기존의 토큰 전송 방식에 약간의 수정만을 통하여 QoS를 지원하는 장점을 가진다. 또한 본 논문에서는 손실된 토큰 회복 메커니즘에 대한 고찰이 이루어진다.

• 한국산학기술학회논문지
• /
• 제10권2호
• /
• pp.280-286
• /
• 2009

NGN(Next-Generation Network)의 구조는 전 IP 유무선 통합망으로서 다양한 관점에서 연구되어져왔으며 이러한 네트워크의 성능은 가장 중요한 쟁점의 하나이다. 본 연구에서는 다양한 유무선 통합망에서 음성 서비스를 제공할 때에 발생할 수 있는 문제점과 요인들을 발견하기 위하여 OPnet 시뮬레이터를 활용하여 성능분석을 수행하였다. 단일의 유선망이나 무선망과는 달리 유무선 통합망에서만 보이는 특성을 측정하고 분석하였다. 특히, 유무선 통합망에서는 네트워크의 전송이 빈번하지 않은 환경에서도 전반적인 망의 성능이 저하되는 결과를 측정하였으며 그밖에도 노드수의 증가와 전송량의 변화에 따른 망의 성능을 비교 분석하였다.

• Journal of information and communication convergence engineering
• /
• 제9권2호
• /
• pp.244-250
• /
• 2011

Gossip is a well-known protocol which was proposed to implement broadcast service with a high reliability in an arbitrarily connected network of sensor nodes. The probabilistic techniques employed in gossip have been used to address many challenges which are caused by flooding in wireless sensor networks (WSNs). However, very little work has yet been done on real-time wireless sensor networks which require not only highly reliable packets reception but also strict time constraint of each packet. Moreover, the unique energy constraining feature of sensor makes existing solutions unsuitable. Combined with unreliable links, redundant messages overhead in real-time wireless sensor networks is a new challenging issue. In this paper, we introduce a Reliable Gossip Zone, a novel fine-tailored mechanism for real-time wireless sensor networks with unreliable wireless links and low packet redundancy. The key idea is the proposed forwarding probability algorithm, which makes forwarding decisions after the realtime flooding zone is set. Evaluation shows that as an oracle broadcast service design, our mechanism achieves significantly less message overhead than traditional flooding and gossip protocols.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권3호
• /
• pp.911-923
• /
• 2014

Ad hoc cognitive radio wireless sensor networks allow secondary wireless sensor nodes to recognize spectrum opportunities and transmit data. Most existing protocols proposed for ad hoc cognitive radio wireless sensor networks require a dedicated common control channel. Allocating one channel just for control packet exchange is a waste of resources for channel-constrained networks. There are very few protocols that do not rely on a common control channel and that exchange channel-negotiation control packets during a pre-allocated time on the data channels. This, however, can require a substantial amount of time to access the channel when an incumbent is present on the channel, where the nodes are intended to negotiate for the data channel. This study examined channel access delay on cognitive radio wireless sensor networks that have no dedicated common control channel.