Chalermek Intanagonwiwat's research while affiliated with Chulalongkorn University and other places

Publications (37)

Article
In this paper, we evaluate M-DWARF performance by experimentation and simulation. We validate its functionalities on TelosB motes and compare its performance with EXT-DESYNC, and LIGHTWEIGHT on TOSSIM. On simulation, we test the algorithms on several multihop topologies and discuss both the average and problematic cases. In addition, we investigate...
Article
Desynchronization is one of the primitive services for complex networks because it arranges nodes to take turns accessing a shared resource. TDMA is a practical application of desynchronization because it allows node to share a common medium. In this paper, we propose a novel desynchronization algorithm using artificial force field called Multi-hop...
Article
In this paper, we use dynamical systems to analyze stability of desynchronization algorithms at equilibrium. We start by illustrating the equilibrium of a dynamic systems and formalizing force components and time phases. Then, we use Linear Approximation to obtain Jaconian (J) matrixes which are used to find the eigenvalues. Next, we employ the Hir...
Article
Full-text available
Wireless Networks of Embedded Systems (WNES) are notoriously difficult and tedious to program. The difficulty is mostly originated from low-level details in system and network programming. This includes distributedly managing and accessing resources from a dynamic set of nodes in hostile and volatile networks. To simplify WNES programming, we propo...
Article
Logic macroprogramming paradigms for wireless sensor networks (WSNs) are rule-based abstractions for programming a network as a whole. Programmers only focus on the main objective of the network rather than the low-level implementation details on each node. Therefore, the low-level details are automatically handled by underlying middleware of the p...
Conference Paper
In recent years, there are several studies on desynchronization for wireless sensor networks. In order to propose new desynchronization protocols, unavoidably, researchers have to implement previous desynchronization works to compare with their own protocols. However, validating the implementations takes time and effort. In this paper, we propose D...
Conference Paper
Several prospective applications on vehicular networks have been defined. Most applications rely on beaconing mechanisms to broadcast the presence and updated information of a vehicle to surrounding neighbors. However, due to the broadcasting nature, no acknowledgement mechanism is provided. Therefore, vehicles do not perceive beacon collision if t...
Article
Full-text available
It is notoriously difficult and tedious to program Wireless Sensor Networks (WSNs). To simplify WSN programming, we propose Sense2P, a logic macro-programming system for abstracting, programming, and using WSNs as globally deductive databases. Unlike macro-programs in previous works, our logic macro-programs can be described declaratively and imper...
Article
Full-text available
Desynchronization is useful for scheduling nodes to perform tasks at different time. This property is desirable for resource sharing, TDMA scheduling, and collision avoiding. Inspired by robotic circular formation, we propose DWARF (Desynchronization With an ARtificial Force field), a novel technique for desynchronization in wireless networks. Each...
Conference Paper
Push-pull approaches for peer-to-peer live streaming systems have gained tremendous popularity due to their high scalability and low latency. However, such approaches rely on buffer-map information of all neighbors to determine which piece to push and which peer to pull. Therefore, those approaches incur significant overhead in order to maintain th...
Article
In Delay Tolerant Networks (DTNs), network partitioning is likely to happen due to sparse and mobile nodes with limited transmission ranges. The network partitioning leads to the unavailability of fully connected paths from sources to destinations. To deal with this problem, many routing schemes are proposed such as Epidemic routing and Spray and W...
Conference Paper
Existing mesh-push approaches for peer-to-peer live streaming systems have been reported to significantly reduce diffusion latency, overlay-construction difficulty, maintenance complication, and churning impact. However, those approaches incur excessive duplicate data and result in bandwidth inefficiency due to stale information as well as chunk sy...
Conference Paper
This paper proposes an Orthodontics-inspired desynchronization algorithm for scheduling wireless sensor nodes to avoid conflicts on resource sharing by not accessing the resource at the same time. Applications of desynchronization include TDMA scheduling, wake-sleep scheduling, and collision avoiding. Although existing desynchronization approaches...
Conference Paper
Full-text available
Content dissemination in Vehicular Ad-Hoc Networks (VANET) has attracted wide interest in the research community. The use of network coding for file sharing has been proved to overcome several problems such as highly dynamic topology and intermittent connectivity. Prior works have originally been designed to work well even with only single hop comm...
Article
Full-text available
In recent years, efficient energy utilization becomes an essential requirement for data centers, especially in data centers of world-leading companies, where "Green Data Center" defines a new term for an environment-concerned data center. Solutions to change existing a data center to the green one may vary. In the big company, high-cost approaches...
Conference Paper
Wireless sensor network (WSN) applications usually demand a time-synchronization protocol for node coordination and data interpretation. In this paper, we propose an Energy-Efficient Gradient Time Synchronization Protocol (EGTSP) for Wireless Sensor Networks. In contrast to FTSP, a state-of-the-art synchronization protocol for WSNs, EGTSP is a comp...
Conference Paper
Several research efforts have abstracted wireless sensor networks as relational databases whose data can be easily queried by users. However, none of these works includes recursive query mechanisms and globally logic reasoning techniques necessary for powerful uses as in deductive databases. In this paper, we propose an approach for abstracting wir...
Conference Paper
Wireless sensor networks consist of a large number of sensor nodes with limited power and resource. To prolong network lifetime, the energy consumption must be somehow reduced. In this paper, we propose a localized density control algorithm for energy savings. The goals are to maintain a minimal number of active sensor nodes and to reduce radio-tra...
Conference Paper
In wireless ad hoc networks, all nodes are routers that are required to forward packets for each other. Undoubtedly, nodes that forward more packets will run out of power before others will. To save energy, some nodes may become selfish and refuse to forward packets. As a result, the overall system performance will be degraded with the increased nu...
Conference Paper
Bittorrent is currently one of the most popular peer-to-peer (P2P) file sharing protocols. However, it incurs such excessive amount of traffic that it may adversely affect users of legacy internet applications. To limit this adverse impact, an efficient methodology for bittorrent identification may be needed. In this paper, we propose a novel appro...
Conference Paper
Full-text available
Programming Wireless Networks of Embedded Systems (WNES) is notoriously difficult and tedious. To simplify WNESprogramming,we proposeDeclarativeResourceNam- ing (DRN) to program WNES as a whole (i.e., macropro- gramming) instead of several networked entities. DRN al- lows programmers to declaratively describe a set of de- sired resources by their r...
Article
Full-text available
During the next decade, emerging technologies will help populating the physical space with ubiquitous networks of embedded systems (NES). Programming NES requires new abstractions and computing models since the current programming models are not designed for the scale and volatility encountered in these networks. This paper presents Spatial Program...
Article
Smart Messages (SMs) are dynamic collections of code and data that migrate to nodes of interest in the network and execute on these nodes. A key challenge in programming pervasive computing environments using SMs is the ability to route SMs to nodes named by content. This paper describes the SM self-routing mechanism, which allows SMs to route them...
Conference Paper
Full-text available
Spatial programming (SP) is a space-aware programming model for outdoor distributed embedded systems. Central to SP are the concepts of space and spatial reference, which provide applications with a virtual resource naming in networks of embedded systems. A network resource is referenced using its expected physical location and properties. Together...
Conference Paper
Full-text available
During the next decade, emerging technologies will help populating the physical space with ubiquitous networks of embedded systems (NES). Programming NES requires new abstractions and computing models since the current programming, models are not designed for the scale and volatility encountered in these networks. This paper presents Spatial Progra...
Article
Advances in processor, memory, and radio technology enable small and cheap nodes capable of sensing, communication, and computation. Networks of such nodes can coordinate to perform distributed sensing of environmental phenomena. We explore the directed diffusion paradigm for such coordination. Directed diffusion is data-centric in that all communi...
Conference Paper
Full-text available
Future ubiquitous computing environments will consist of massive, ad hoc networks of embedded systems deployed in the physical space. Programming such environments requires new abstractions and computing models. This paper presents Spatial Programming (SP), a novel paradigm for programming ubiquitous computing environments. SP o#ers access to data...
Conference Paper
Full-text available
Smart messages (SMs) are dynamic collections of code and data that migrate to nodes of interest in the network and execute on these nodes. A key challenge in programming pervasive computing environments using SMs is the ability to route SMs to nodes named by content. This paper describes the SM self-routing mechanism, which allows SMs to route them...
Conference Paper
In-network data aggregation is essential for wireless sensor networks where energy resources are limited. In a previously proposed data dissemination scheme (directed diffusion with opportunistic aggregation), data is opportunistically aggregated at intermediate nodes on a low-latency tree. In this paper, we explore and evaluate greedy aggregation,...
Article
In most distributed systems, naming of nodes for low-level communication leverages topological location (such as node addresses) and is independent of any application. In this paper, we investigate an emerging class of distributed systems where low-level communication does not rely on network topological location. Rather, low-level communication is...
Article
Full-text available
Experience with wired networks has provides guidance about what level of detail is appropriate for simulationbased protocol studies. Wireless simulations raise many new questions about approriate levels of detail in simulation models for radio propagation and energy consumption. This paper describes the trade-offs associated with adding detail to s...
Article
Advances in processor, memory and radio technology will enable small and cheap nodes capable of sensing, communication and computation. Networks of such nodes can coordinate to perform distributed sensing of environmental phenomena. In this paper, we explore the directed diusion paradigm for such coordination. Directed diusion is datacentric in tha...
Conference Paper
Advances in processor, memory and radio technology will enable small and cheap nodes capable of sensing, communication and computation. Networks of such nodes can coordinate to perform distributed sensing of environmental phenomena. In this paper, we explore the directed diffusion paradigm for such coordination. Directed diffusion is datacentric in...
Article
Acknowledgments First of all, I would like to express my deepest gratitude and appreciation to my advisors, Professor Deborah Estrin, Professor Ramesh Govindan, and Professor John Heidemann for their unlimited patience, constant encouragement, vision, inspiration, and guidance throughout my study. I was extremely fortunate to have three advisors wh...

Citations

... It is also known as data-centric routing because base station sends queries to certain regions and waits for data from the sensors located in the selected regions. Some popular data-centric or flatbased routing protocols are Flooding, Gossiping [39], SPIN [40], Directed Diffusion [41], Rumor routing [42], Gradient based routing [43], COUGAR [44], ACQUIRE [45], MCFA [46]. However, flat-based routings show the limitations regarding reliable data delivery and fault-tolerance, result routing overhead and latency with the increase in node density. ...
... Besides, many energy-aware routing protocols have been proposed to reduce energy consumption and improve the network lifetime [29]. For instance, the direct diffusion protocol [30] has been proposed as a solution to reduce the energy consumption in WSN nodes. In addition, various methods are proposed for WSN applications to estimate energy consumption. ...
... Vinitha et al. [18] proposed a multi-hop routing technique that is energy efficient. In Ref. [19], the authors analyzed the query processing technique's characteristics in the WSNs. In Ref. [20], the authors proposed a localization technique that provides accurate location of WSNs. ...
... Some algorithms use probabilistic techniques based on certain heuristics to establish routing paths. Some examples of routing protocol based on flat topology are Sensor Protocols for Information via negotiation (SPIN) [44,68], Directed-Diffusion [69], Rumor-Routing [70], etc. ...
... The Different Neighbor History Spray and Wait (DNH-SaW) Routing [9] improves SaW. Instead of forwarding constant number of L message copies, DNH-SaW dynamically calculates number of message copies L to be forwarded based on performance factor of encountered node in spray phase. ...
... Extensive research has been done on data aggregation approaches [23][24][25][26]. However these approaches only focus on redundancy reduction without considering security. ...
... This protocol is designed for WSNs and does fragmentation and segment reassembly and reliable delivery of messages [50,51]. It is selective NACK-based extension of directed diffusion applicable to a sensor node and configurable with no need to recompile. ...
... In the literature, various authors [1], [2], [5], [12], [13], [14], [15], [16], [17], [18], [19], [20] have proposed distributed desynchronization algorithms for WSN MAC-layer coordination. The main idea connecting these proposals is in modeling as Pulse-Coupled Oscillators (PCOs) the actions of biological agents such as fireflies, where a timing mechanism with a periodic pulsing is adjusted based on the timings of pulses sensed from a subset of the remaining nodes. ...
... Declarative resource naming [43] (DRN) allows both imperative and declarative resource grouping using Boolean expressions. Resource binding can be static or dynamic and the access to resources can be sequential or parallel. ...
... Active networks are considered as an endeavor to add intelligence in the network to advance data packets with information code including the packet processing logic [8]. Network nodes such as switches and routers execute the code embedded in the packet to support customized treatment of data packets [9,10]. This architecture mainly aims to enhance networks facilitates with computation abilities permitting the deployment of new services into the network in an ondemand manner. ...